Leetcode 34

//二分查找后，向两边扩展，二分错了两次，现在是对的。
//还有就是vector可以用{}直接赋值很棒

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        int left = ;
        int right = nums.size()-;
        int mid = -;
        bool flag = false;
        while(left<=right){
            mid = (left+right)/;
            if(nums[mid] == target){flag = true;break;}
            else if(nums[mid] < target){left = mid+;}
            else{right = mid-;}
        }
        if(flag == false) return {-,-};

        int begin = mid;
        while(begin >= ){
            if(nums[begin] != target) break;
            begin--;
        }
        begin++;

        int end = mid;
        while(end < nums.size()){
            if(nums[end] != target)break;
            end++;
        }
        end--;
        return {begin,end};
    }
};

//递归的二分
int search(vector<int>& nums, int left, int right, int target) {
        if (left > right) return -;
        int mid = left + (right - left) / ;
        if (nums[mid] == target) return mid;
        else if (nums[mid] < target) return search(nums, mid + , right, target);
        else return search(nums, left, mid - , target);
    }