【Lintcode】076.Longest Increasing Subsequence

题目：

Given a sequence of integers, find the longest increasing subsequence (LIS).

You code should return the length of the LIS.

Clarification

What's the definition of longest increasing subsequence?

The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique.
https://en.wikipedia.org/wiki/Longest_increasing_subsequence

Example

For [5, 4, 1, 2, 3], the LIS is [1, 2, 3], return 3
For [4, 2, 4, 5, 3, 7], the LIS is [2, 4, 5, 7], return 4

题解：

　　For dp[i], dp[i] is max(dp[j]+1, dp[i]), for all j < i and nums[j] < nums[i].

Solution 1 ()

class Solution {
public:int longestIncreasingSubsequence(vector<int> nums) {if (nums.empty()) {return 0;}vector<int> dp(nums.size(), 1);int res = 1;for (int i = 1; i < nums.size(); ++i) {for (int j = 0; j < i; ++j) {if (nums[j] < nums[i]) {dp[i] = max(dp[i], dp[j] + 1);}}res = max(dp[i], res);}return res;}
};

Solution 2 ()

class Solution {
public:/*** @param nums: The integer array* @return: The length of LIS (longest increasing subsequence)*/int longestIncreasingSubsequence(vector<int> nums) {vector<int> res;for(int i=0; i<nums.size(); i++) {auto it = std::lower_bound(res.begin(), res.end(), nums[i]);if(it==res.end()) res.push_back(nums[i]);else *it = nums[i];}return res.size();}
};

Solution 3 ()

class Solution {
public:int longestIncreasingSubsequence(vector<int> nums) {if (nums.empty()) {return 0;}vector<int> tmp;tmp.push_back(nums[0]);for (auto num : nums) {if (num < tmp[0]) {tmp[0] = num;} else if (num > tmp.back()) {tmp.push_back(num);} else {int begin = 0, end = tmp.size();while (begin < end) {int mid = begin + (end - begin) / 2;if (tmp[mid] < num) {begin = mid + 1;} else {end = mid;}}tmp[end] = num;}}return tmp.size();}
};

转载于:https://www.cnblogs.com/Atanisi/p/6883116.html

【Lintcode】076.Longest Increasing Subsequence相关推荐

【leetcode】521. Longest Uncommon Subsequence I
题目如下: 解题思路:本题有点意思.首先如果输入的两个字符串都为空,那么结果是-1:如果两个字符串长度不一样,那么结果是较长的字符串的长度,因为较长的字符串肯定是自身的子序列,但一定不是较短的字符串的 ...
【暴力】LeetCode 300. Longest Increasing Subsequence
LeetCode 300. Longest Increasing Subsequence Solution1:我的答案暴力搜索,时间复杂度O(n2)O(n2)O(n^2) class Solutio ...
Rosalind Java|Longest Increasing Subsequence动态规划算法
Rosalind编程问题之计算集合中最长的递增元素子集. Longest Increasing Subsequence Problem: A subsequence of a permutation ...
HPU第三次积分赛-D：Longest Increasing Subsequence（DP）
Longest Increasing Subsequence 描述给出一组长度为n的序列,a1,a2,a3,a4...an, 求出这个序列长度为k的严格递增子序列的个数输入第一行输入T ...
[Swift]LeetCode673. 最长递增子序列的个数 | Number of Longest Increasing Subsequence
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ ➤微信公众号:山青咏芝(shanqingyongzhi) ➤博客园地址:山青咏芝(https://www.cnblog ...
The Longest Increasing Subsequence (LIS)
传送门 The task is to find the length of the longest subsequence in a given array of integers such that ...
C++longest increasing subsequence 最长递增子序列的实现之二(附完整源码)
C++longest increasing subsequence 最长递增子序列的实现 C++longest increasing subsequence 最长递增子序列的的实现完整源码(定义,实现 ...
C++longest increasing subsequence 最长递增子序列的实现之一(附完整源码)
C++longest increasing subsequence 最长递增子序列的实现 C++longest increasing subsequence 最长递增子序列的的实现完整源码(定义,实现 ...
leetcode 300. Longest Increasing Subsequence | 300. 最长递增子序列（动态规划）
题目 https://leetcode.com/problems/longest-increasing-subsequence/ 题解难得有官方题解的一道题. 参考:https://leetcode ...

【Lintcode】076.Longest Increasing Subsequence

【Lintcode】076.Longest Increasing Subsequence相关推荐

最新文章

热门文章