class Solution {
public:
bool search(int A[], int n, int target) {
int left=0,right=n-1;
while(left<=right)
{
int mid=left+(right-left)/2;
if(A[mid]==target) return true;
if(A[left]<A[mid])
{
if(A[left]<=target && target<A[mid])
{
right=mid-1;
}
else
{
left=mid+1;
}
}
else if(A[left]>A[mid])
{
if(A[mid]<target && target<=A[right])
{
left=mid+1;
}
else
{
right=mid-1;
}
}
else
{
left++;
}
}
return false;
}
};
Search in Rotated Sorted Array II
最新推荐文章于 2021-12-18 23:10:30 发布