当前位置：网站首页>Sword finger offer 53 - ii Missing numbers from 0 to n-1

Sword finger offer 53 - ii Missing numbers from 0 to n-1

2022-07-18 21:09:00 【anieoo】

Original link ： The finger of the sword Offer 53 - II. 0～n-1 Missing numbers in

 

solution:
        Two points , An ordered array can be divided into two parts , The first part is the array value corresponding to the subscript , The second part is that the subscript and array values are not equal , Use bisection to find the position where the first subscript is not equal to the array value .

class Solution {
public:
    int missingNumber(vector<int>& nums) {
        int l = 0,r = nums.size();
        while(l < r) {
            int mid = (l + r) >> 1;
            if(nums[mid] != mid) r = mid;
            else l = mid + 1;
        }
        return l;
    }
};
原网站

版权声明
本文为[anieoo]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/199/202207161824559637.html

边栏推荐

猜你喜欢

随机推荐