Given an unsorted array of integers, find the length of longest increasing subsequence.
For example,
Given [10, 9, 2, 5, 3, 7, 101, 18]
,
The longest increasing subsequence is [2, 3, 7, 101]
, therefore the length is 4
. Note that there may be more than one LIS combination, it is only necessary for you to return the length.
Your algorithm should run in O(n2) complexity.
Follow up: Could you improve it to O(n log n) time complexity?
class Solution {
public:
/*algorithm: DP
dp(i): book the longest sequence from i to n
dp(i-1)= max{dp(k)}+1 i<=k<n
2,5,3,4
3 1 2 1
return max{dp[0]...dp[n-1]}
time O(N*N) space O(n)
*/
int lengthOfLIS(vector<int>& nums) {
int n = nums.size();
vector<int>dp(n,1);
for(int i = n-2;i>=0;i--){
for(int j = i+1;j < n;j++){
if(nums[i] < nums[j]){
dp[i] = max(dp[i],dp[j]+1);
}
}
}
int maxLen = 0;
for(int i = 0;i < n;i++){
maxLen=max(maxLen,dp[i]);
}
return maxLen;
}
};