[LeetCode] Search for a Range

最新推荐文章于 2024-09-19 08:57:00 发布

lyangpku

最新推荐文章于 2024-09-19 08:57:00 发布

阅读量410

点赞数

分类专栏： LeetCode 面试题二分算法文章标签： Leetcode leetcode LeetCode 二分算法面试题

本文链接：https://blog.csdn.net/lyangpku/article/details/8549085

版权

LeetCode 同时被 3 个专栏收录

110 篇文章 0 订阅

订阅专栏

面试题

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)