LeetCode-Increasing Triplet Subsequence

Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.

Formally the function should:

Return true if there exists i, j, k
such that arr[i] < arr[j] < arr[k] given 0 ≤ i < j < k ≤ n-1 else return false.

Your algorithm should run in O(n) time complexity and O(1) space complexity.

Examples:
Given [1, 2, 3, 4, 5],
return true.

Given [5, 4, 3, 2, 1],
return false.

Analysis:

it is a simplified version of LIS.

Solution:

public class Solution {
    public boolean increasingTriplet(int[] nums) {
        if (nums.length < 3) return false;
        
        int p1=0;
        int p2 = -1;
        for (int i=1;i<nums.length;i++){
            if (nums[i] <= nums[p1]){
                p1 = i;
            } else if (p2==-1 || nums[i] <= nums[p2]){
                p2 = i;
            } else return true;
        }
        return false;
        
    }
}