Discuss / Java / 先对list排序,做一次遍历,让遍历i=start,然后自增,若不相等则为缺失,break

先对list排序,做一次遍历,让遍历i=start,然后自增,若不相等则为缺失,break

Topic source

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

Collections.sort(list);

int miss = 0;

int i = start;

for (int k: list) {

if  (i != k) {

miss = i;

break;

}

i ++;

}

return miss;

}


  • 1

Reply