LeetCode之Find Minimum in Rotated Sorted Array

/*二分查找。*/
class Solution {
public:
    int findMin(vector<int>& nums) {
        int l = 0, r = nums.size()-1;
        while(l < r){
            int mid = (l + r) / 2;
            if(nums[mid] > nums[mid+1]) return nums[mid+1];
            if(nums[mid] < nums[r]) r = mid;
            else l = mid;
        }
        return nums[l];
    }
};