leetcode 334 : Increasing Triplet Subsequence : 被智商压制

334. Increasing Triplet Subsequence

My Submissions

Question

Total Accepted: 5851  Total Submissions: 17931  Difficulty: Medium

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.

这道题一看三个有序数，就觉得有问题。但是还是想的差一点。无奈只好使用：dp解最长有序+3停止 复杂度O（n*n）

（厚着脸皮贴代码）

public class Solution {
    public boolean increasingTriplet(int[] nums) {
        if(nums.length==0)
        return false;
		int[] count=new int[nums.length];
		count[0]=1;
		for(int i=1;i<nums.length;i++){
			int max=0;
			for(int j=0;j<i;j++){
				if(nums[j]<nums[i]&&count[j]>max)
					max=count[j];
			}
			if(max==2)
				return true;
			else {
				count[i]=max+1;
			}
		}
		return false;
	}
}

实际上有种非常容易想到的解法，不多说：

public boolean increasingTriplet(int[] nums) {
        // start with two largest values, as soon as we find a number bigger than both, 
        //while both have been updated, return true.
        int small = Integer.MAX_VALUE, big = Integer.MAX_VALUE;
        for (int n : nums) {
            if (n <= small) { small = n; }    // update small if n is smaller than both
            else if (n <= big) { big = n; }   // update big only if greater than small but smaller than big
            else return true;                // return if you find a number bigger than both
        }
        return false;
    }

一开始的想法是这样的，虽然没有想明白而放弃。。

public class Solution {
    public boolean increasingTriplet(int[] nums) {
        int min = Integer.MAX_VALUE, 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;
    }
}