153. Find Minimum in Rotated Sorted Array

二分O(logn)

class Solution {
public:
    int findMin(vector<int>& nums) {
        int n = nums.size();
        int l = 0, r = n - 1;
        while (l < r) {
            int m = l + (r - l) / 2;
            if (nums[m] > nums[r]) { // compare m with r rather than l because m could be l but never be r (in that case, m == r == l, impossible)
                l = m + 1;
            } else {
                r = m;
            }
        }
        return nums[l];
    }
};