guanjihuan/GitHub_collection_leetcode
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

another solution for "Longest Increasing Subsequence"

Browse Source
This commit is contained in:
Hao Chen 2016-01-27 00:07:13 +08:00
parent a3f135495e
commit 3786095949
1 changed files with 25 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
algorithms/cpp/longestIncreasingSubsequence/longestIncreasingSubsequence.cpp
View File

@ -1,5 +1,5 @@
// Source : https://leetcode.com/problems/longest-increasing-subsequence/
// Author : Calinescu Valentin
// Author : Calinescu Valentin, Hao Chen
// Date : 2015-11-06
/***************************************************************************************
@ -22,6 +22,30 @@
*
***************************************************************************************/
// O(n^2) - dynamic programming
class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
int len = nums.size();
int maxLen = 0;
vector<int> dp(len, 1);
for (int i=0; i<len; i++) {
for(int j=0; j<i; j++) {
if ( nums[j] < nums[i] ) {
dp[i] = max(dp[i], dp[j] + 1);
}
}
maxLen = max(maxLen, dp[i]);
}
return maxLen;
}
};
class Solution {
public: