0154-find-minimum-in-rotated-sorted-array-ii.py

class Solution:
    def findMin(self, nums: List[int]) -> int:
        l,h=0,len(nums)-1
        while l<=h:
            m=(l+h)//2
            if nums[m]>nums[h]:
                l=m+1
            elif nums[m]<nums[l]:
                h=m
            else:
                h=h-1
        return nums[l]