Solution to " Find Minimum in Rotated Sorted Array II" on Leetcode

FindMinInArrayII.java

class Solution {
    // Final solution
    public int findMin(int[] nums) {
        
        int start = 0;
        int end = nums.length - 1;

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

The worst case is O(N), where all the elements are duplicates. Amortized is O(logn).