81. Search in Rotated Sorted Array II

class Solution {
public:
bool search(vector<int>& nums, int target) {
for(int i=0;i<nums.size();i++)
{
if(nums[i]==target)
return true;
}
return false;
}
};

class Solution {
public:
bool search(vector<int>& nums, int target) {
if(nums.size()==0)
return false;

int left=0;
int right=nums.size()-1;

while(right-left>1)
{
int mid=left+(right-left)/2;//index

if(nums[mid]>nums[left])
{
if(target>nums[mid])
left=mid+1;
else if(target<nums[mid])
{
if(target>nums[left])
right=mid-1;
else if(target<nums[left])
left=mid+1;
else
return true;
}
else
return true;
}
else if(nums[mid]<nums[left])
{
if(target<nums[mid])
right=mid-1;
else if(target>nums[mid])
{
if(target>nums[right])
right=mid-1;
else if(target<nums[right])
left=mid+1;
else
return true;
}
else
return true;
}
else
left++;
}

//[left,right]

if(nums[left]==target)
return true;
else if(nums[right]==target)
return true;
else
return false;
}
};