leetcode每日-2022.01.12-334.递增的三元组

class Solution {
public:
    bool increasingTriplet(vector<int>& nums) {
        if (nums.size() < 3)  //小于三直接为false
            return false;
        int num_one = INT_MAX, num_two = INT_MAX;  //num_one记录最小元素,num_two为某个子序列的第二小元素，不断更新num_one，同时使num_two尽量小，直到找到一个比他俩都大的数
        for (int i = 0; i < nums.size(); ++i){
            if (nums[i] <= num_one)
                num_one = nums[i];
            else if (nums[i] <= num_two)
                num_two = nums[i];
            else 
                return true; 
        }
        return false;
    }
};