二分搜索

一、寻找一个数

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;
}

二、寻找一个数的左侧边界

int left_bound(int[] nums, int target) {
    int left = 0, right = nums.length - 1;
    // 搜索区间为 [left, right]
    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;
        }
    }
    // 检查left出界情况
    if (left >= nums.length || nums[left] != target)
        return -1;
    return left;
}

三、寻找一个数的右侧边界

int right_bound(int[] nums, int target) {
    int left = 0, right = nums.length - 1;
    //搜索区间[left,right]
    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,right-1]
            right = mid - 1;
        } else if (nums[mid] == target) {
            // 收缩左侧边界
            left = mid + 1;
        }
    }
    // 检查 right 越界的情况
    if (right < 0 || nums[right] != target)
        return -1;
    return right;
}

四、寻找一个数的左右边界

class Solution {
public:
    //左边界查找
    int left_bound(vector<int>&nums, int target) {
    int left = 0, right = nums.size() - 1;
    // 搜索区间为 [left, right]
    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;
        }
    }
    // 检查left出界情况
    if (left >= nums.size() || nums[left] != target)
        return -1;
    return left;
}
    //右边界查找
    int right_bound(vector<int>&nums, int target) {
    int left = 0, right = nums.size() - 1;
    //搜索区间[left,right]
    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,right-1]
            right = mid - 1;
        } else if (nums[mid] == target) {
            // 收缩左侧边界
            left = mid + 1;
        }
    }
    // 检查 right 越界的情况
    if (right < 0 || nums[right] != target)
        return -1;
    return right;
    }
    vector<int> searchRange(vector<int>& nums, int target) {
        int left=left_bound(nums,target);
        int right=right_bound(nums,target);
        vector<int>res={left,right};
        return res;
    }
};