[LeetCode] Search for a Range

110 篇文章 0 订阅
110 篇文章 0 订阅
class Solution {
public:
    int find_left(int A[], int s, int t, int target) {
        int l = s;
        int r = t;
        
        while (l <= r) {
            int p = (l + r) / 2;
            if (A[p] < target)
                l = p + 1;
            else
                r = p - 1;
        }
        
        return l;
    }
    
    int find_right(int A[], int s, int t, int target) {
        int l = s;
        int r = t;
        
        while (l <= r) {
            int p = (l + r) / 2;
            if (A[p] > target)
                r = p - 1;
            else
                l = p + 1;
        }
        
        return r;
    }
    
    vector<int> searchRange(int A[], int n, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> ret;
        
        int s = 0;
        int t = n - 1;
        
        while (s <= t) {
            int p = (s + t) / 2;
            
            if (A[p] == target) {
                int l = find_left(A, s, p, target);
                int r = find_right(A, p, t, target);
                ret.push_back(l);
                ret.push_back(r);
                
                return ret;
            } else if (A[p] < target) {
                s = p + 1;
            } else {
                t = p - 1;
            }
        }
        
        ret.push_back(-1);
        ret.push_back(-1);
        
        return ret;
    }
};


Small Case: 12ms

Large Case: 64ms


Time: O(lgn)

Space: O(1)

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值