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:
int lengthOfLIS(vector<int>& nums) {
if(nums.empty())
return 0;
int size=nums.size();
int dp[size];
fill(dp,dp+size,1);
int maxLen=1;
for(int i=1;i<size;++i){
for(int j=0;j<i;++j){
if(nums[i]>nums[j]&&dp[i]<dp[j]+1){
dp[i]=dp[j]+1;
maxLen=max(maxLen,dp[i]);
}
}
}
return maxLen;
}
};