Search_in_rotated_sorted_array_II.cpp

#include <iostream>
#include <vector>
using namespace std;

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