<doocs>0153.Find Minimum in Rotated Sorted Array_1.py
def findMin( nums: List[int]) -> int:
    if nums[0] <= nums[-1]:
        return nums[0]
    left, right = 0, len(nums) - 1
    while left < right:
        mid = (left + right) >> 1
        if nums[0] <= nums[mid]:
            left = mid + 1
        else:
            right = mid
    return nums[left]
def sample_funcname ( var_0 : List [ int ] ) -> int :
    if var_0 [ 0 ] <= var_0 [ - 1 ] :
        return var_0 [ 0 ]
    var_5 , var_7 = 0 , len ( var_0 ) - 1
    while var_5 < var_7 :
        var_8 = ( var_5 + var_7 ) >> 1
        if var_0 [ 0 ] <= var_0 [ var_8 ] :
            var_5 = var_8 + 1
        else :
            var_7 = var_8
    return var_0 [ var_5 ]
