334. Increasing Triplet Subsequence

Description

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.
Note: Your algorithm should run in O(n) time complexity and O(1) space complexity.

Example 1:

Input: [1,2,3,4,5]
Output: true
Example 2:

Input: [5,4,3,2,1]
Output: false

Problem URL

---

Solution

判断一个数组中是否有三个数是递增的

Using two int to contain two previous small numbers. They are initially Integer.MAX_VALUE. Then iteratively traverse the nums array, if n is smaller than n1, assign to n1; else if n is bigger than n1 but smaller than n2, assgin n to n2. Now n1 and n2 have elements of nums. If we find another number bigger than n1 and n2, that is the answer.

Code

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

Time Complexity: O(n)
Space Complexity: O(1)

---

Review