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.

这个题算是比较简单的了。

我用一个只包含两个数的数组，只要大于a[0]就代表这个数组中有两个数是递增的，只要大于a[1]就代表这个数组中有三个数是递增的。

public class Solution {
    public boolean increasingTriplet(int[] nums) {
		int max=Integer.MAX_VALUE;
        if(nums.length<3||nums[0]==max)
        	return false;
        int[] a=new int[]{max,max};
        a[0]=nums[0];
        for(int i=1;i<nums.length;i++){
        	if(nums[i]<=a[0]){
        		a[0]=nums[i];
        	}else{
        		if(nums[i]<=a[1]){
        			a[1]=nums[i];
        		}else{
        			return true;
        		}
        	}
        }
        return false;
    }
}