LeetCode 之 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.

需要注意到由于没有重复元素所以这个题相对简单点，采用二分查找的方法，比较low和high的相对大小来决定最小的元素再哪里。

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