[LeetCode 解题报告]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:

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

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