[LeetCode] Longest Increasing Subsequence
发布时间:2020-12-14 04:49:48 所属栏目:大数据 来源:网络整理
导读:Given an unsorted array of integers,find the length of longest increasing subsequence. Example: Input: Output: 4 Explanation: The longest increasing subsequence is,therefore the length is . [10,9,2,5,3,7,101,18][2,101]4 Note: There may be
Given an unsorted array of integers,find the length of longest increasing subsequence. Example: Input: Output: 4 Explanation: The longest increasing subsequence is,therefore the length is . [10,9,2,5,3,7,101,18][2,101]4 Note:
Follow up:?Could you improve it to O(n?log?n) time complexity? O(n^2): dp class Solution { public: int lengthOfLIS(vector<int>& nums) { int n = nums.size(); vector<int> dp(n,1); int res = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < i; ++j) { if (nums[j] < nums[i]) dp[i] = max(dp[i],dp[j]+1); } res = max(res,dp[i]); } return res; } }; (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |