题解 | 旋转数组的最小数字

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