[LeetCode]Search in Rotated Sorted Array II

Search in Rotated Sorted Array II

Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Write a function to determine if a given target is in the array.

和Search in Rotated Sorted Array一样，将return mid改成return true，将return -1改成return false即可。

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