search-in-rotated-sorted-array-ii.cpp

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