leetcode-154-寻找旋转排序数组中的最小值

题目描述：

方法一：

class Solution:
    def findMin(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]