搜索范围

还是用二分查找，增加限制条件：

查找区间左端点时，当target == nums[mid]时，如果mid == 0 || nums[mid-1]<target，说明mid就是区间的左端点

否则，设置要查找的区间右端点mid-1

查找区间右端点时，当target == nums[mid]时，如果mid == nums.size()-1 || nums[mid+1]>target，说明mid就是区间的右端点

否则，设置要查找的区间左端点mid+1

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> res;
        
        res.push_back(left(nums,target));
        res.push_back(right(nums,target));
        
        return res;
    }
    
    //左端点
    int left(vector<int>& nums, int target)
    {
        int begin = 0;
        int end = nums.size() - 1;
        while(begin <= end)
        {
            int mid = (begin + end)/2;
            if( target == nums[mid])
            {
                if(mid == 0 || target > nums[mid-1])//说明到了要查找的区间的左端点
                    return mid;
                end = mid -1;//否则，虽然找到了这个数，但不是左端点，继续查找
            }else if(target < nums[mid])
                end = mid - 1;
            else if(target > nums[mid])
                begin = mid +1;              
        }
        return -1;
    }
    
    //右端点
    int right(vector<int>& nums, int target)
    {
        int begin = 0;
        int end = nums.size() - 1;
        while(begin <= end)
        {
            int mid = (begin + end)/2;
            if( target == nums[mid])
            {
                if(mid == nums.size()-1 || target < nums[mid+1])//说明到了要查找的区间的右端点
                    return mid;
                begin = mid + 1;//否则，虽然找到了这个数，但不是右端点，继续查找
            }else if(target < nums[mid])
                end = mid - 1;
            else if(target > nums[mid])
                begin = mid +1;              
        }
        return -1;
    }
};