# LeetCode: 154. Find Minimum in Rotated Sorted Array II

## 题目¶

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,4,4,5,6,7] might become:

```[4,5,6,7,0,1,4] if it was rotated 4 times.
[0,1,4,4,5,6,7] if it was rotated 7 times.
```

Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]].

Given the sorted rotated array nums that may contain duplicates, return the minimum element of this array.

Example 1:

```Input: nums = [1,3,5]
Output: 1
```

Example 2:

```Input: nums = [2,2,2,0,1]
Output: 0
```

## 解法¶

```class Solution:
def findMin(self, nums):
if len(nums) <= 2:
return min(nums)

left = 0
right = len(nums) - 1
while left < right:
mid = left + (right - left) // 2
if nums[mid] < nums[right]:
right = mid
# 虽然相等，但是不一定在左边还是右边，
# 比如 [1, 2, 2] [3, 3, 1, 3]
elif nums[mid] == nums[right]:
right = right - 1
else:
left = mid + 1

return nums[right]
```