34.查找某数的区间位置

Search for a Range

问题描述：

Given an array of integers sorted in ascending order, 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].

知识补充：

函数equal_range()返回first和last之间等于val的元素区间.返回值是一对迭代器。

result = equal_range( nums.begin(), nums.end(), new_val );

测试代码：

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> res;
        int left = 0,right = nums.size(),mid = -1;
        while(left<right)
        {
            mid = (left+right)/2;
            if(nums[mid]>target)
            {
                right = mid;
            }else if(nums[mid]<target)
            {
                left = mid+1;
            }else{
                int left1 = mid;
                int right1 = mid;
                while(nums[left1]==target&&left1>-1)
                {
                    left1--;
                }
                while(nums[right1]==target&&right1<nums.size())
                {
                    right1++;
                }
                res.push_back(left1+1);
                res.push_back(right1-1);
                break;
            }
        }

        if(res.empty())
        {
            res.push_back(-1);
            res.push_back(-1);
        }
        return res;
    }
};

性能：

参考答案：

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        auto bounds = equal_range(nums.begin(), nums.end(), target);
        if(bounds.first == bounds.second){
            return {-1,-1};
        }
        return {bounds.first-nums.begin(), bounds.second-nums.begin()-1};
    }
};

性能：