Leetcode 153. 寻找旋转排序数组中的最小值

二分查找

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