Discuss / Java / O(1)空间复杂度,O(n)时间复杂度算法

O(1)空间复杂度,O(n)时间复杂度算法

Topic source

可姆可汗

#1 Created at ... [Delete] [Delete and Lock User]

static int findMissingNumber(int start, int end, List<Integer> list) {

int sum = (start + end) * (end - start + 1) / 2;

for (Integer n : list) {

sum -= n;

}

return sum;

}


  • 1

Reply