Leetcode之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

代码：

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

想法：

仔细思考逻辑