class Solution:
def minArray(self, numbers: List[int]) -> int:
i,j = 0,len(numbers)-1
while i<j:
m = i+(j-i) // 2
if numbers[m]>numbers[j]:
i = m+1
elif numbers[m] < numbers[j]:
j = m
else:
j = j-1
# return min(numbers[i:j])
return numbers[i]
每日一道Leetcode - 剑指 Offer 11. 旋转数组的最小数字 【二分查找】
最新推荐文章于 2021-12-05 16:44:54 发布