300. Longest Increasing Subsequence LeetCode
2016-02-14 19:19
417 查看
题意：最长公共子序列。
题解：dp。
题解：dp。
class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
int n = nums.size();
int dp
;
int j = 0,k;
for(int i = 0; i < n; i++) dp[i] = -0x3f3f3f3f;
for(int i = 0; i < n; i++)
{
for(k = j; k >= 0; k--)
if(nums[i] > dp[k])
{
dp[++k] = nums[i];
break;
}
j = max(k,j);
}
return j;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解