334. Increasing Triplet Subsequence

class Solution {
    public boolean increasingTriplet(int[] nums) {
        
        int first = Integer.MAX_VALUE;
        int sec = Integer.MAX_VALUE;
        
        for (int n : nums) {
            if (n <= first) {
                first = n;
            } else if (n <= sec) {
                sec = n;
            } else {
                return true; 
            }
        }
        return false;
        
    }
}

Runtime: 0 ms, faster than 100.00% of Java online submissions for Increasing Triplet Subsequence.
Memory Usage: 38.4 MB, less than 96.59% of Java online submissions for Increasing Triplet Subsequence.