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?
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/longest-increasing-subsequence
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
我的思路:
求一个序列的最长的子序列(可以不连续),使得这个子序列是不下降的
dp[i]:以A[i]结尾的最长不下降子序列和长度,dp数组中所有数据的最大值即为所求
1)若存在a【j】 < a【i】 并且 dp【j】 + 1 > dp【i】, 那么就更新dp【i】
2)如果a【i】之前都比a【i】小,则a【i】只能自成序列,长度为1
class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
int n = nums.size();
if(n == 0) return 0;
int dp[nums.size()];
int ans = -1;
for(int i = 0; i < n; i++){
dp[i] = 1;
for(int j = 0; j < i; j++){
if(nums[i] > nums[j] && dp[j] + 1 > dp[i]){
dp[i] = dp[j]+1;
}
}
ans = max(ans, dp[i]);
}
return ans;
}
};