34、Search for a Range

最新推荐文章于 2022-01-21 16:09:17 发布

littledou2015

最新推荐文章于 2022-01-21 16:09:17 发布

阅读量410

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/littledouble/article/details/43163857

版权

Leetcode 专栏收录该内容

33 篇文章 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].

Binary Search

 vector<int> searchRange(int A[], int n, int target) {
        int low = 0, high = n, mid;
        while (low < high)
        {
            mid = (low + high) / 2;
            if (A[mid] < target)
                low = mid + 1;
            else if (A[mid] > target)
                high = mid;
            else
                break;
        }
        vector<int> result;
        if (A[mid] != target)
        {
            result.push_back(-1);
            result.push_back(-1);
        }
        else
        {
            int low1 = low, high1 = mid;
            while (low1 < high1)
            {
                mid = (low1 + high1) / 2;
                if (A[mid] >= target)
                    high1 = mid;
                else
                    low1 = mid + 1;
            }
            result.push_back(low1);
            low1 = mid, high1 = high;
            while (low1 < high1)
            {
                mid = (low1 + high1) / 2;
                if (A[mid] > target)
                    high1 = mid;
                else
                    low1 = mid + 1;
            }
            result.push_back(low1 - 1);
        }
        return result;
    }