LeetCode : Find Minimum in Rotated Sorted Array

使用二分查找。

int findMin(vector<int>& nums)
{
    int begin = 0, end = nums.size() - 1;
    while(begin < end)
    {
        int mid = (begin + end) / 2;

        if(mid == begin) // 只剩两个数的时候
            return min(nums[begin], nums[end]);

        if(nums[mid] > nums[end])
            begin = mid;
        else
            end = mid;      
    }
    return nums[begin];
}