Code: Select all
public int missingNumber(int[] nums) {
int n = nums.length;
int sorts = nums.sort();
for(int i = 0;i < sorts.length;i++){
int diff = (sorts[i]+1) - sorts[i];
if(diff > 1){
return sorts[i]+1;
}
}
}
Code: Select all
public int missingNumber(int[] nums) {
int n = nums.length;
int sorts = nums.sort();
for(int i = 0;i < sorts.length;i++){
int diff = (sorts[i]+1) - sorts[i];
if(diff > 1){
return sorts[i]+1;
}
}
}