[LeetCode] #334 Increasing Triplet Subsequence

特别没劲，但是自己想不出来的一道题。T_T

public class Solution {
    public boolean increasingTriplet(int[] nums) {
        int first = Integer.MAX_VALUE;
        int second = Integer.MAX_VALUE;
        
        for (int i = 0; i < nums.length; i++) {
            if (first >= nums[i]) {
                first = nums[i];
                continue;
            } else if (second >= nums[i]) {
                second = nums[i];
                continue;
            } else {
                return true;
            }
        }
        
        return false;
    }
}