LeetCode 334 递增的三元子序列

• DP时间复杂度O(n**2)，贪心时间复杂度O(n)。

class Solution {
public:
    bool increasingTriplet(vector<int>& vec) {
        int size = vec.size();
        if (size < 3) return false;

        int first = vec[0], second = INT_MAX;
        for(int i = 0; i < size; ++i) {
            if(vec[i] > second) {
                return true;
            } else if (vec[i] > first) {
                second = vec[i];
            } else {
                first = vec[i];
            }
        }

        return false;

        /*
        int size = vec.size();
        std::vector<int> dp(size, 1);

        for(int i = 1; i < size; ++i) {
            int max_temp = -1;
            for(int j = i - 1; j >= 0; --j) {
                if (vec[i] > vec[j]) {
                    max_temp = max_temp < dp[j] ? dp[j] : max_temp;
                }

            }
            if (max_temp >= 2) return true;
            else if (max_temp > 0) {
                    dp[i] = max_temp + 1;
            }
        }
        return false;
        */
    }
};