1 二分查找

1、目标二分

题目：二分查找

1.1 [left,right],左闭右闭区间二分

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int l = 0, r = nums.size() - 1,mid;
        //搜素区间为左闭右闭
        while(l <= r){
            mid = (l+r)/2;   
            if(nums[mid] == target) return mid;
            //[l,mid-1]
            else if (nums[mid] > target) r = mid - 1;
            //[mid+1,r]
            else if(nums[mid] < target) l = mid + 1;
        }
        return -1;
    }
};

1.2 [left,right),左闭右开区间二分

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int l = 0,r = nums.size();
        //搜索区间为左闭右开
        while(l < r){
            int mid = ( l + r ) >> 1;
            if(nums[mid] == target) 
                return mid;
            //[l,mid)
            else if(nums[mid] > target) 
                r = mid;
            //[mid+1,r)    
            else
                l = mid + 1;
        }
        return -1;
    }
};

2 边界二分

题目：数的范围

2.1 查找左边界

int l = 0,r = n -1;
while(l < r){
    int mid = l + r >> 1;
    if(q[mid] >= k) r = mid;
    else l = mid + 1;
}

2.2 查找右边界

int l = 0,r = n -1;
while(l < r){
    int mid = l + r + 1 >> 1;
    if(q[mid] <= k) l = mid;
    else r = mid - 1;
}

1、寻找左边界，目标区间为[target,mid]，因此r = mid，否则 l = mid + 1
2、寻找右边界，目标区间为[mid,target]，因此l = mid，否则 r = mid - 1
注：右边界，mid = l + r + 1 >> 1，否则l、r相差1，mid一直等于l

思考：为什么边界二分while(l < r)
因为l == r 会导致死循环问题，条件判断语句中没有有效的return