![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/130abc402141ef5e020a485e898f2515.png)
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/fd16f730d5be2e13a260ec476ac932f9.png)
代码:
class Solution:
def minArray(self, numbers: List[int]) -> int:
left, right = 0, 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 -= 1
return numbers[left]