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.

class Solution {
public:

bool search(int A[], int n, int target) {
if(A==NULL||n<=0){
return false;
}
int begin=0,end=n-1,mid=0;
while(begin<=end){
mid=begin+(end-begin)/2;
if(A[mid]==A[begin]&&A[mid]==A[end]){
break;
}
if(target==A[mid]||target==A[begin]||target==A[end]){
return true;
}

if(A[mid]<=A[end]&&A[end]<=A[begin]){
if(target>A[mid]&&target<A[end]){
begin=mid+1;
}else{
end=mid-1;
}
}else{
if(target<A[mid]&&target>A[begin]){
end=mid-1;
}else{
begin=mid+1;
}
}

}
for(int i=begin;i<=end;i++){
if(A[i]==target){
return true;
}
}
return false;
}
};