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.

bool search(int A[], int n, int target) {        // Note: The Solution object is instantiated only once.        int begin = 0;int end = n-1;while(begin < end){int mid = (begin+end)/2;if(A[mid] == target)return true;else if(A[begin] == A[mid]){for(int i = begin; i< mid; i++)if(A[i]==target)return true;begin = mid+1;}else if(A[begin] < A[mid])//begin-mid increase{if(A[begin] <= target && target < A[mid])end = mid-1;elsebegin = mid+1;}else//mid-end increase{if(A[mid] < target && target <= A[end])begin = mid+1;elseend = mid-1;}}if(begin==end && A[begin]==target)return true;elsereturn false;    }