¡¾LeetCodeÈÈÌâ100¡¿¡¾¶þ·Ö²éÕÒ¡¿ÔÚÅÅÐòÊý×éÖвéÕÒÔªËصĵÚÒ»¸öºÍ×îºóÒ»¸öλÖÃ

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