[Leetcode] Search in Rotated Sorted Array II (Java)

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.

循环数组允许重复值，返回这个数组中是否存在target

public class Solution {    public boolean search(int[] A, int target) {int left=0;int right=A.length-1;while(left<=right){int mid=left+((right-left)>>1);if(A[mid]==target)return true;if(A[mid]==A[right]){right--;}else if(A[mid]<A[right]){if(A[mid]<target&&A[right]>=target)left=mid+1;else right=mid-1;}else {if(A[left]<=target&&A[mid]>target)right=mid-1;elseleft=mid+1;}}return false;            }}