Given an unsorted array of integers, find the length of longest increasing subsequence.
Example:
Input: [10,9,2,5,3,7,101,18]
Output: 4
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.
Note:
- 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?
题意
给定一个无序的整数数组,找到其中最长上升子序列的长度。
思路1
dp[i]
表示以当前元素结尾的最长子序列
代码1
class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
int len = nums.size();
if(len == 0) return 0;
vector<int> dp(len);
for(int i = 0; i < len; i++)
{
dp[i] = 1;
for(int j = 0; j < i; j++)
{
if(nums[i] > nums[j])
dp[i] = max(dp[i], dp[j] + 1);
}
}
int ans = 0;
for(int i = 0; i < len; i++)
ans = max(ans, dp[i]);
return ans;
}
};