LeetCode Search for a Range

最新推荐文章于 2024-02-20 21:37:45 发布

飞哥是个行动pie

最新推荐文章于 2024-02-20 21:37:45 发布

阅读量283

点赞数

分类专栏： leetcode oj 解题报告

本文链接：https://blog.csdn.net/aa3615058/article/details/43413007

版权

leetcode oj 解题报告专栏收录该内容

22 篇文章 0 订阅

订阅专栏

Search for a Range

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) {
        vector<int> r(2, -1);
        int i = 0, j = n - 1, m = (i + j) / 2, a, b;
        while(i <= j) {
            if(A[m] == target) {
                r[0] = m;
                r[1] = m;
                a = m - 1;
                b = m + 1;
                break;
            }
            else if(target > A[m]) i = m + 1;
            else j = m - 1;
            m = (i + j) / 2;
        }
        while(i <= a) {
            m = (i + a) / 2;
            if(i == a) {
                if(A[m] == target) r[0] = m;
                break;
            }
            if(A[m] == target) {
                r[0] = m;
                a = m - 1;
            } else i = m + 1;
        }
        while(b <= j) {
            m = (b + j) / 2;
            if(b == j) {
                if(A[m] == target) r[1] = m;
                break;
            }
            if(A[m] == target) {
                r[1] = m;
                b = m + 1;
            } else j = m - 1;
        }
        return r;
    }
};

思路：解法时间复杂度O(logn)。先找到一个target，然后左右分别应用折半查找法找左边界和右边界。