二分查找的魔鬼细节

1、寻找一个数（基础的二分查找）

int binarySearch(int[] nums, int target) {
    int left = 0;
    int right = nums.length - 1; // 注意
 
    while(left <= right) { // 注意 right初始化为nums.length - 1
        int mid = left + (right - left) / 2;
        if(nums[mid] == target)
            return mid;
        else if (nums[mid] < target)
            left = mid + 1; // 注意 mid != target,则下一步搜索的区间应为[left,mid - 1]
        else if (nums[mid] > target)
            right = mid - 1; // 注意 mid != target,则下一步搜索的区间应为[mid + 1,right]
        }
    return -1;
}

2、二分查找寻找左边界

int left_bound(int[] nums, int target) {
    if (nums.length == 0) return -1;
    int left = 0;
    int right = nums.length; // 注意
 
    while (left < right) { // 注意 right初始为nums.length
        int mid = left + (right - left) / 2;
        if (nums[mid] == target) {
            right = mid; //寻找左边界，则要缩小右边界
        } else if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid; // 注意
        }
    }
    if(left == nums.length) return -1;
    return nums[left] == target ? left : -1;
}

3、二分查找寻找右边界

int right_bound(int[] nums, int target) {
    if (nums.length == 0) return -1;
    int left = 0, right = nums.length;
 
    while (left < right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] == target) {
            left = mid + 1; // 注意 寻找右边界 则要扩展左边界
        } else if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid;
        }
    }
    if(left == 0) return -1;
    return nums[left - 1] == target ? (left - 1) : -1; // 注意
}