[Array]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) {
        int left = 0,right = nums.size()-1;
        while(left<right){
            int middle = (left + right)/2;
            if(nums[middle]>=nums[right])
                left = middle+1;
            else
                right = middle;
        }
        return nums[left];
        
    }
};