Increasing Triplet Subsequence -- Leetcode -- FB

Question:

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.

Answer:
Time: O(n), Space: O(1)
public boolean increasingTriplet(int[] nums) {
        if(nums==null || nums.length==0)return false;
        int max = Integer.MAX_VALUE;
        int min = nums[0];
     
        for(int i=1; i<nums.length; ++i){
            if(nums[i] < min){
                min = nums[i];
            }else if(nums[i] > max){
                return true;
            }else if(nums[i] > min && nums[i] < max){
                max = nums[i];
            }
        }
        return false;
    }