原题目:https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii/
思路:
和前一题一样,不过增加了相等的情况,此时应该将right--;
代码:
class Solution {
public:
int findMin(vector<int>& nums) {
int low = 0, high = nums.size() - 1;
while (low < high) {
int pivot = low + (high - low) / 2;
if (nums[pivot] < nums[high])
high = pivot;
else if (nums[pivot] > nums[high])
low = pivot + 1;
else
high -= 1;
}
return nums[low];
}
};