【LeetCode热题100道】34. 在排序数组中查找元素的第一个和最后一个位置

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {

        if(nums.size()<1 || nums[0] > target || nums[nums.size()-1] < target)
        {
            return vector<int>{-1, -1};
        }
        int left = 0;
        int right = nums.size()-1;
        int mid = 0;
        while(left <= right)
        {
            mid = (left+right)/2;
            if(nums[mid] == target)
            {
                break;
            }
            else if(nums[mid] < target)
            {
                left = mid +1;
            }
            else
            {
                right = mid -1;
            }
        }
        if(nums[mid] != target)
        {
            return vector<int>{-1, -1};
        }
        left = mid;
        right = mid;
        while(left >= 0 && nums[left] == target)
        {
            left--;
        }
        while(right < nums.size() && nums[right] == target)
        {
            right++;
        }
        return vector<int>{left+1, right-1};
    }
};