Search for a Range

最新推荐文章于 2022-03-08 23:18:06 发布

人生本是磨难

最新推荐文章于 2022-03-08 23:18:06 发布

阅读量119

点赞数

分类专栏： LeetCode原创文章标签：递归搜索

本文链接：https://blog.csdn.net/yiwu2011/article/details/49906519

版权

LeetCode原创专栏收录该内容

4 篇文章 0 订阅

订阅专栏

题目来源：https://leetcode.com/problems/search-for-a-range/

class Solution {
public:
    // 记住最后递归的left 和right 能够减少寻找左边界和右边界的时间。
    int binarySearch(vector<int> &nums, int left, int right, int target) {
        int mid = (left + right) / 2;
        if(left > right)
            return -1;
        if(nums[mid] == target)
            return mid;
        if(nums[mid] > target)
            return binarySearch(nums, left, mid - 1, target);
        if(nums[mid] < target)
            return binarySearch(nums, mid + 1, right, target);
    }
    // 设置isRight bool 值来判断是左边界还是有边界。
    int binarySearchLR(vector<int> &nums, int left, int right, int target, bool isRight) {
        int mid = (left + right) / 2;
        if(isRight) {
            if(left == right)
                return left;
            if(nums[mid] == target && nums[mid + 1] != target)
                return mid;
            else if(nums[mid] == target && nums[mid + 1] == target )
                return binarySearchLR(nums, mid + 1, right, target, true);
            else
                return binarySearchLR(nums, left, mid - 1, target, true);
        }
        else {
         // 这里需要考虑mid - 1是否会越界，因为只有两个元素时，mid总等于left，而如果left是0，则mid - 1会越界
            if(left == right || left == right - 1) {
                if(nums[left] == target)
                    return left;
                return right;
            }
            if(nums[mid] == target && nums[mid - 1] != target)
                return mid;
            else if(nums[mid] == target && nums[mid - 1] == target )
                return binarySearchLR(nums, left, mid - 1, target, false);
            else
                return binarySearchLR(nums, mid + 1, right, target, false);
        }
    }
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> result{-1, -1};
        if(nums.empty())
            return result;
        int n = nums.size();
        int findIndex = binarySearch(nums, 0, n - 1, target);
        if(findIndex == -1)
            return result;
        result[0] = binarySearchLR(nums, 0, findIndex, target, false);
        result[1] = binarySearchLR(nums, findIndex, n - 1, target, true);
        return result;
    }
};