leetcode-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.

思路：依然与无重复的类似，主要是考虑有重复时，A[p]==A[mid]的情况，这时，不能决定往左还是往右，故只能移动一步。

代码：

bool search(int A[], int n, int target) {
        int p=0;
int q=n-1;
int mid=0;
while(p<=q)
{
mid=(p+q)/2;




if(A[mid] == target)
{
return true;
}




if(A[p]<A[mid])
{
if(A[p]<=target && A[mid]>target)
{
q=mid-1;
}
else
p=mid+1;
}
else if(A[p]>A[mid])
{
if(A[mid]<target && target<=A[q])
{
p=mid+1;
}
else
{
q=mid-1;
}
}
else
p++;
}
return false;
    }