Find Minimum in Rotated Sorted Array II

The array may contain duplicates.

• Time: O(n)
• Space: O(1)

public int findMin(int[] nums) {
    int l = 0, r = nums.length - 1;
    while (l <= r && nums[l] >= nums[r]) {
        int mid = (l + r) / 2;
        if (nums[mid] < nums[r]) {
            r = mid;
        } else if (nums[mid] > nums[r]) {
            l = mid + 1;
        } else {
            r--;
        }
    }
    return nums[l];
}