leetcode34. Search for a Range

本文详细解析了LeetCode第34题Search for a Range的解决方案,通过递归二分查找的方式找到目标值在有序数组中首次和末次出现的位置。文章提供了完整的C++实现代码,并针对不同输入情况进行了讨论。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

leetcode34. Search for a Range

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> result = {};
        if(nums.size()<1){
            result.push_back(-1);
            result.push_back(-1);
            return result;
        }        
        if(nums.size()==1){
            if(nums[0] == target){

                result.push_back(0);
                result.push_back(0);
            }else{
                result.push_back(-1);
                result.push_back(-1);
            }
            return result;
        }
        int left = 0;
        int right = nums.size() - 1;
        int medium = left+(right - left) / 2;
        left = searchLeftPos(nums,target,left,medium);
        right = searchRightPos(nums,target,medium+1,right);
        if(left == -1){
            left = searchLeftPos(nums,target,medium+1,right);
        }

        if(right == -1){
            right = searchRightPos(nums,target,left,medium);
        }
        result.push_back(left);
            result.push_back(right);
            return result;
    }
    int searchLeftPos(vector<int>& nums, int target,int left, int right){
        if(right<=left){
            if(target==nums[left]) return left;
            else return -1;
        }
        int medium = left+(right - left) / 2;
        left = searchLeftPos(nums,target,left,medium);

        if(left == -1){
            left = searchLeftPos(nums,target,medium+1,right);
        }
        return left;
    }

    int searchRightPos(vector<int>& nums, int target,int left, int right){
        if(right<=left){
            if(target==nums[left]) return left;
            else return -1;
        }
        int medium = left+(right - left) / 2;

        right = searchRightPos(nums,target,medium+1,right);


        if(right == -1){
            right = searchRightPos(nums,target,left,medium);
        }
        return right;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值