LeetCode @ Search in Rotated Sorted ArrayII 旋转数组查找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.

"对left移动一步，直到边缘和中间不在相等或者相遇，这就导致了会有不能切去一半的可能。所以最坏情况（比如全部都是一个元素，或者只有一个元素不同于其他元素，而他就在最后一个）就会出现每次移动一步，总共是n步，算法的时间复杂度变成O(n)。"

代码的分类情况以Soulmachine为主，我做了right index赋值的调整，以及if-elseif-else调整

<span style="font-size:12px;">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)/2;
            if(A[mid]==target)
                return true;
            if(A[left]<A[mid]){
                if(A[left]<=target && target<A[mid])
                    right=mid-1;
                else
                    left=mid+1;
            }
            else if(A[left]==A[mid]){
                left++;
            }
            else{
                if(A[mid]<target && target<=A[right])
                    left=mid+1;
                else
                    right=mid-1;
            }
        }
        return false;
    }
}
</span>