81. 搜索旋转排序数组 II——二分查找

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

Accepted
279/279 cases passed (4 ms)
Your runtime beats 87.15 % of cpp submissions
Your memory usage beats 66.2 % of cpp submissions (13.6 MB)