[leetcode][search] Find Minimum in Rotated Sorted Array

题目：

Suppose a sorted array 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.

class Solution {
public:
    int findMin(vector<int>& nums) {
	    return findMinCore(nums, 0, nums.size() - 1);
    }
private:
    int findMinCore(vector<int> &nums, int start, int end){
	    if (start > end) return INT_MAX;
	    if (start == end || nums[start] < nums[end]) return nums[start];
	    int mid = (start + end) >> 1;
	    //start和end之间存在pivot
	    return min(findMinCore(nums, start, mid), findMinCore(nums, mid + 1, end));
    }

};