[LeetCode 解题报告]153. Find Minimum in Rotated Sorted Array

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.

You may assume no duplicate exists in the array.

Example 1:

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

Example 2:

Input: [4,5,6,7,0,1,2]
Output: 0

考察：规律如下图所示：

左子序列最小值 大于 右子序列最大值 or  左子序列最小值 等于 右子序列所有值

 

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