有序:
static int findMissingNumber(int start, int end, List<Integer> list) {
int n = start;
for (int i:list){
if (i!=n)
break;
n++;
}
return n;
无序:
int total = 0;
for(int i = start; i <= end; i++)
total += i;
for(int j:list)
total -= j;
return total;
Sign in to make a reply
沸腾的冰水2018
有序:
static int findMissingNumber(int start, int end, List<Integer> list) {
int n = start;
for (int i:list){
if (i!=n)
break;
n++;
}
return n;
}
无序:
static int findMissingNumber(int start, int end, List<Integer> list) {
int total = 0;
for(int i = start; i <= end; i++)
total += i;
for(int j:list)
total -= j;
return total;
}