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

def solve():
    def findMin(____):
        left, right = ____, len(____) - ____
        while left < right:
            mid = (____) // ____
            if nums[mid] > nums[right]:
                left = mid + ____
            else:
                right = mid
        return nums[left]
    print(findMin(____))