Follow upfor "Find Minimum in Rotated Sorted Array":
What ifduplicatesare allowed?

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

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

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

Find the minimum element.

The array may contain duplicates.

class Solution {
    public int findMin(int[] nums) {
        if (nums == null || nums.length == 0) return 0;
        if (nums.length == 1) return nums[0];

        int start = 0, end = nums.length - 1;
        while (end > start && nums[start] == nums[end]){
            end--;
        }

        while (start + 1 < end){
            if (nums[start] < nums[end]) return nums[start];

            int mid = start + (end - start) / 2;
            if (nums[mid] >= nums[start]){
                start = mid;
            }
            else{
                end = mid;
            }
        }

        return Math.min(nums[start], nums[end]);
    }
}