static int findMissingNumber(int start, int end, List<Integer> list) {
Integer[] lis = new Integer[end - start + 1];
for (int i = start; i <= end; i++) {
lis[i - start] = i;
}
for (Integer one : list) {
lis[one - start] = null;
}
int i = -1;
for (Integer k : lis) {
if (k != null)
i = (int) k;
}
return i;
}
黯然
自己构造一个数组后剔除已有的,最后返回剩下的