Find Minimum in Rotated Sorted Array II

lcpy gen -n 154   # by problem number
lcpy gen -s find_minimum_in_rotated_sorted_array_ii   # by problem name

Input: nums = [1,3,5]
Output: 1

Input: nums = [2,2,2,0,1]
Output: 0

class Solution:
    # Time: O(log n) average, O(n) worst case with all-duplicate stretches
    # Space: O(1)
    def find_min(self, nums: list[int]) -> int:
        left, right = 0, len(nums) - 1
        while left < right:
            mid = (left + right) // 2
            if nums[mid] > nums[right]:
                left = mid + 1
            elif nums[mid] < nums[right]:
                right = mid
            else:
                right -= 1
        return nums[left]