34. Search for a Range

class Solution 
{
public:
    vector<int> searchRange(vector<int>& nums, int target) 
    {
        int sz=nums.size();
        if(sz==0)
            return {-1,-1};
        if(target<nums[0]||target>nums[sz-1])
            return {-1,-1};
        int left=0,right=sz-1;
        int resleft=0,resright=0;
        while(left<right)
        {
            int mid=left+((right-left)>>1);
            int cur=nums[mid];
            if(cur>=target)
                right=mid;
            else
                left=mid+1;
        }
        resleft=left;
        if(nums[resleft]!=target)
            return {-1,-1};
        left=0,right=sz-1;
        while(left<right)
        {
            int mid=left+((right-left)>>1);
            int cur=nums[mid];
            if(cur>target)
                right=mid;
            else
                left=mid+1;
        }
        resright=left;
        if(nums[resright]==target)
            return {resleft,resright};
        else
            return {resleft,resright-1};
    }
};

两个二分，问题不大