遍历查找
class Solution {
public int missingNumber(int[] nums)
{
for (int i = 0; i < nums.length; i++)
{if (nums[i]!=i)return i;
}
return nums.length;//这是为了{0}专门加的
}
}
二分查找法
class Solution {
public int missingNumber(int[] nums) {
int left=0;
int right=nums.length-1;
int mid=(left+right)/2;
while(left<=right){
if(mid==nums[mid]) {
left=mid+1;
}
else {right=mid-1;}
mid=(left+right)/2;
}
return left;
}
}