class Solution: def minNumberInRotateArray(self, rotateArray): left = 0 right = len(rotateArray) - 1 mid = 0 while (rotateArray[right] <= rotateArray[left]): mid = int((left + right) / 2) if right - left == 1: return rotateArray[right] # 这种情况下就不知道缩小哪边了,只能遍历了 # [1, 0, 1, 1, 1] # [1, 1, 1, 0, 1] if...