Find Minimum in Rotated Sorted Array II

题目：

Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Find the minimum element.

The array may contain duplicates.

代码：

public class Solution {
    public int findMin(int[] nums) 
    {
        int len=nums.length;
        int left=0;
        int right=len-1;
        
        while(left<right)
        {
            int mid=(left+right)/2;
            if(nums[mid]>nums[right])
            {
                left=mid+1;
            }
            else if (nums[mid]<nums[right])
            {
                right=mid;
            }
            else
20             {
21                 right=right-1;
22             }

        }
        
        return nums[left];
        
    }
}