https://leetcode-cn.com/problems/que-shi-de-shu-zi-lcof/
代码
class Solution {
public int missingNumber(int[] nums) {
int left = 0; //左
int right = nums.length-1; //右
while(left<=right){
int mid = (left+right)/2; //中
//如果能在mid位置匹配相等,说明mid以左都相等。需要往右检查
if(nums[mid] == mid)
left = mid+1;
//反之,如果出现不相等的情况,说明在mid此处或者此处以左就已经开始不正确了
else
right = mid-1;
}
return left;
}
}