334. 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.

Credits:
Special thanks to @DjangoUnchained for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

分析：
动态规划的经典解法。
但是时间比较长。有更优化的方法。
代码：
class Solution {
public:
    bool increasingTriplet(vector<int>& nums) {
        if(nums.size()<3) return false;
        vector<int> dp(nums.size(),1);
        for(int i=0;i<nums.size();++i)
        {
            for(int j=0;j<i;++j)
            {
                if((nums[i]>nums[j])&&dp[i]<max(dp[i],dp[j]+1))
                dp[i]=max(dp[i],dp[j]+1);
                if(dp[i]>2) return true;
            }
        }
        return false;
    }
};