本文共 402 字，大约阅读时间需要 1 分钟。

class Solution:    def minArray(self, numbers: List[int]) -> int:        left = 0        right = len(numbers)-1        while left < right:            mid = (left + right) // 2            if numbers[mid] > numbers[right]:                left = mid + 1            elif numbers[mid] < numbers[right]:                right = mid            else:                right = right - 1        return numbers[left]