leetcode: Search for a Range

504 篇文章 0 订阅
230 篇文章 0 订阅

Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].

class Solution {
public:
    vector<int> searchRange(int A[], int n, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        int low  = 0;
        int high = n-1;
        int mid  = (low+high)/2;
        
        int beginPos = -1;
        int endPos   = -1;
        
        vector<int> retVector;

        // first, we want to find the left,
        while (mid < high)
        {
            // here is the main proces
            if (A[mid] >= target)
            {
                high = mid;
            }
            else
            {
                low = mid+1;
            }
            mid = (low+high)/2;
        }
        
        if (A[mid] != target)
        {
            retVector.push_back(beginPos);
            retVector.push_back(endPos);           
            return retVector;
        }
        beginPos = mid;
        
        low  = 0;
        high = n-1;
        mid  = (low+high)/2;
        
        while (mid > low)
        { 
            if (A[mid] <= target)
            {
                low = mid;
            }
            else
            {
                high = mid-1;
            }
            mid = (low+high)/2;
        }
        
        if (A[high] == target)
        {
            endPos = high;
        }
        else
        {
            endPos = mid;
        }
        
        retVector.push_back(beginPos);
        retVector.push_back(endPos);
        
        return retVector;
    }
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值