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.

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

思路： 找出当前的最小值和第二小的值，如果还有值比第二小的值大，那么就return true；否则return false；

class Solution {
    public boolean increasingTriplet(int[] nums) {
        int min = Integer.MAX_VALUE;
        int secondmin = Integer.MAX_VALUE;
        for(int num: nums) {
            if(num <= min) {
                min = num;
            } else if(num <= secondmin) {
                secondmin = num; 
            } else if(num > secondmin) {
                return true;
            }
        }
        return false;
    }
}