数据结构与算法——二分搜索模板

参考链接

1. https://labuladong.gitee.io/algo/

二分搜索模板

最基本的二分搜索

int binary_search(vector<int> nums, int target)
{
    int left = 0;
    int right = nums.size() - 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)
        {
            return mid;
        }
    }
}

寻找左侧边界的二分搜索

int left_bound(vector<int> nums, int target)
{
    int left = 0;
    int right = nums.size() - 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)
        {
            //收缩右边界，锁定左侧边界
            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;
    int right = nums.size() - 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;
}