[DP] Leetcode 300 Longest Increasing Subsequence
2017-12-30 10:24
369 查看
O(N2) 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;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- DP问题：leetcode(300) Longest Increasing Subsequence
- LeetCode 300: Longest Increasing Subsequence
- Leetcode 300 Longest Increasing Subsequence
- <LeetCode OJ> Longest Increasing Subsequence【300】
- 第七周：(LeetCode 300) Longest Increasing Subsequence（c++）
- [leetcode 300] Longest Increasing Subsequence
- leetcode——300—— Longest Increasing Subsequence
- leetcode 300: Longest Increasing Subsequence
- LeetCode300——Longest Increasing Subsequence
- leetcode_[python/C++]_300_Longest Increasing Subsequence
- LeetCode—300 Longest Increasing Subsequence
- （Leetcode）Longest Increasing Subsequence——dp，bisearch
- Leetcode 300 Longest Increasing Subsequence（Python）
- LeetCode 300 Longest Increasing Subsequence
- leetcode 354. Russian Doll Envelopes & leetcode 300 Longest Increasing Subsequence
- Leetcode 300 Longest Increasing Subsequence 最长递增子序列
- [leetcode300] Longest Increasing Subsequence
- leetcode-300-Longest Increasing Subsequence 动态规划
- [leetcode-300]Longest Increasing Subsequence(java)
- 【LeetCode】300 Longest Increasing Subsequence