题目
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
Find the minimum element.
The array may contain duplicates.
解题思路
如果二分中点小于右边，右端点移动到中点，大于右边，左端点移动到中点+1，相等，右端点减一
代码
class Solution:
def findMin(self, nums: List[int]) -> int:
l, r = 0, len(nums) - 1
while l < r:
m = (l + r) // 2
if nums[m] < nums[r]:
r = m
elif nums[m] > nums[r]:
l = m + 1
else:
r -= 1
return nums[l]
