class Solution {
public:
int missingNumber(vector<int>& nums) {
int l = 0, r = nums.size() - 1;
while (l <= r) {
int mid = (l+r) >> 1 ;
if(nums[mid] == mid) l = mid + 1;
else r = mid - 1;
}
return l;
}
};
剑指offer 53:0~n-1中缺失的数字
猜你喜欢
转载自blog.csdn.net/weixin_44537258/article/details/114168260
今日推荐
周排行