2021-03-11

` int binarySearchTemplate(int[] nums, int target){
int left = 0, right = …;
while (…){
int mid = left + (right - left) / 2;

        if (nums[mid] == target) {

        } else if(nums[mid] < target){

        } else if(nums[mid] > target){

        }
    }
    return ...;
}

int binarySearch(int[] nums, int target){
    int left = 0;
    int right = nums.length - 1;
    while (left <= right){
        int mid = left + (right - left) / 2;
        if (nums[mid] == target) {
            return mid;
        } else if(nums[mid] < target){
            left = mid + 1;
        } else if(nums[mid] > target){
            right = mid - 1;
        }
    }
    return -1;
}


/*
* nums = [1,2,2,2,3] target = 2
*
* */
/*寻找左边界*/
int left_bound(int[] nums, int target){
    if(nums.length == 0){
        return -1;
    }
    int left = 0;
    int right = nums.length - 1;
    while (left <= right){
        int mid = left + (right - left) / 2;
        if(nums[mid] < target){
            //搜索区间[mid+1,right]
            left = mid + 1;
        }else if(nums[mid] > target){
            //搜索区间[left,mid-1]
            right = mid - 1;
        }else if(nums[mid] == target){
            //收缩右边界
            right = mid - 1;
        }
    }
    //检查出界情况
    /*
    * nums = [1,2,2,2,3] target = 4
    * */
    //检查left越界情况
    if(left >= nums.length || nums[left] != target)
        return -1;
    return left;
}

/*寻找右边界*/
int right_bound(int[] nums, int target){
    if(nums.length == 0){
        return -1;
    }
    int left = 0;
    int right = nums.length - 1;
    while (left <= right){
        int mid = left + (right - left) / 2;
        if(nums[mid] < target){
            left = mid + 1;
        }else if(nums[mid] > target){
            right = mid - 1;
        }else if(nums[mid] == target){
            //收缩左边界
            left = mid + 1;
        }
    }
    //检查right越界情况
    if(right < 0 || nums[right] != target)
        return -1;
    return right;
}
`