class Solution {
public:
    int findMin(vector<int>& nums) {
        int n = nums.size() - 1;
        if (n < 0) {
            return -1;
        }

        while (n > 0 && nums[n] == nums[0]) {
            --n;
        }

        int l = 0, r = n;
        while (l < r) {
            int mid = l + r >> 1;
            if (nums[mid] <= nums[r]) {
                r = mid;
            } else {
                l = mid + 1;
            }
        }
        return nums[r];
    }
};