def getMin(arr): low = 0 high = len(arr) - 1 if len(arr) == 0: return 0 if len(arr) ==1: return arr[0] while low <= high: mid = (low + high) >> 1 # 右移一位相当于除以2 if arr[mid]>arr[high]: low = mid + 1 elif arr[mid] < arr[low]: high = mid else: high -= 1 return arr[low]