leetcode之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].

解答：

很明显对于求左边界可以直接用二分法即可，求右边界的时候直接利用已经知道的左边界即可

当然也可以利用二分法再进行一次右边界的求值（和左边界稍微有点不同，需要进行和右边的值得是否相等的判断，比如2,2这种情况的存在）

但是事实证明第一种方法在时间上是更优的

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        int l = 0;
        int r = nums.size() - 1;
        int left = -1;
        int right =-1;
        while(l < r)
        {
            int mid = (l + r) >> 1;
            if(nums[mid] == target)
                r = mid;
            else if(nums[mid] > target)
                r = mid - 1;
            else
                l = mid + 1;
        }
        if(nums[l] == target)
            left = l;
        right = left;
        if(left == -1)    //先确认在数组中是否存在target目标的值
             return {left,right};
        while(right < nums.size() && nums[right] == target)
            right++;
        return {left,right - 1};
    }
};