// 有序 +无序
static int findMissingNumber(int start, int end, List<Integer> list) {
int sum = ((list.size()+1)*(start+end))/2;
for(int i :list){
sum-=i;
}
return sum;
Sign in to make a reply
陆佩廷
// 有序 +无序
static int findMissingNumber(int start, int end, List<Integer> list) {
int sum = ((list.size()+1)*(start+end))/2;
for(int i :list){
sum-=i;
}
return sum;
}