154. Find Minimum in Rotated Sorted Array II

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.

Example 1:

Input: [1,3,5]
Output: 1
Example 2:

Input: [2,2,2,0,1]
Output: 0

Note:

1. This is a follow up problem to Find Minimum in Rotated Sorted Array.
2. Would allow duplicates affect the run-time complexity? How and why?

方法1:

思路：

和上一题唯一的区别就是，当mid == end的时候，无法判断应该抛弃左边还是右边。这个时候只能将right–，因为即使right是最小值，我们也还有mid，没有丢掉。

class Solution {
public:
    int findMin(vector<int>& nums) {
        int n = nums.size();
        if (n == 1) return nums[0];
        int left = 1, right = n - 1;
        while (left < right) {
            int mid = left + (right - left) / 2;
            if (nums[mid - 1] > nums[mid]) return nums[mid];
            else {
                if (nums[mid] == nums[right]) right--;
                else if (nums[mid] < nums[right]) right = mid;
                else left = mid + 1;
            }
        }
        return min(nums[left - 1], nums[left]);
    }
};