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) {return find(A, 0, n - 1, target);}bool find(int A[], int left, int right, int target) {if (right < left)return false;int mid = left + ((right - left) >> 1);if (A[mid] == target)return true;else if (A[left] < A[right])             //二分查找return A[mid] < target ? find(A, mid + 1, right, target) : find(A, left, mid - 1, target);elsereturn find(A, left, mid - 1, target) || find(A, mid + 1, right, target);}};