[DP] Leetcode 300 Longest Increasing Subsequence

$O(N^2)$ code

class Solution {
public:
    int lengthOfLIS(vector<int>& seq) {
        if (seq.empty()) return 0;
        // lens indicate the sequence END by element t
        vector<int> lens(seq.size(), 1);
        int maxLen = 1;

        for (int t = 1; t < seq.size(); ++t) { // t: stop position
            for (int s = 0; s < t; ++s) {      // s: start position
                if ((seq[t] > seq[s]) && (lens[s] + 1 > lens[t])){
                    lens[t] = lens[s] + 1;
                }
            }
            if (lens[t] > maxLen) maxLen = lens[t];
        }
        return maxLen;
    }
};