动态规划中级教程 646. Maximum Length of Pair Chain
来源:互联网 发布:童年动画 知乎 编辑:程序博客网 时间:2024/06/05 19:33
You are given n
pairs of numbers. In every pair, the first number is always smaller than the second number.
Now, we define a pair (c, d)
can follow another pair (a, b)
if and only if b < c
. Chain of pairs can be formed in this fashion.
Given a set of pairs, find the length longest chain which can be formed. You needn't use up all the given pairs. You can select pairs in any order.
Example 1:
Input: [[1,2], [2,3], [3,4]]Output: 2Explanation: The longest chain is [1,2] -> [3,4]
Note:
- The number of given pairs will be in the range [1, 1000].
说给我们一串链,找到最长的可以连接的链,条件是 【i】。frist 》 【j】。second
直接分析
【1,2】
dp【0】=1
【1,2】,【2,3】
dp【1】=1
【1,2】,【2,3】,【3,4】
dp【2】=dp【0】+1
写到这里大家可以发现这跟LIS基本是一样的这里已经可以写出状态转移方程
dp【i】=max(dp【i】,dp【j】+1);
class Solution {public: int findLongestChain(vector<vector<int>>& pairs) { if(pairs.size()==0 )return 0; sort(pairs.begin(),pairs.end()); int dp[pairs.size()]; for(int i=0;i<pairs.size();i++) { dp[i]=1; } int ans=1; for(int i=1;i<pairs.size();i++) { for(int j=0;j<i;j++) { if(pairs[i][0]>pairs[j][1]) { dp[i]=max(dp[i],dp[j]+1); ans=max(ans,dp[i]); } } } return ans; }};
阅读全文
0 0
- 动态规划中级教程 646. Maximum Length of Pair Chain
- 646. Maximum Length of Pair Chain(动态规划 vs 贪心)
- 646. Maximum Length of Pair Chain
- 646. Maximum Length of Pair Chain
- [leetcode]646. Maximum Length of Pair Chain
- leetcode 646. Maximum Length of Pair Chain
- 646. Maximum Length of Pair Chain
- LeetCode 646. Maximum Length of Pair Chain
- [Leetcode] 646. Maximum Length of Pair Chain
- 646. Maximum Length of Pair Chain
- 646. Maximum Length of Pair Chain
- leetcode 646. Maximum Length of Pair Chain
- 646. Maximum Length of Pair Chain
- [leetcode] 646. Maximum Length of Pair Chain
- 646. Maximum Length of Pair Chain
- 646. Maximum Length of Pair Chain(M)
- [LeetCode] 646. Maximum Length of Pair Chain
- [LeetCode] 646. Maximum Length of Pair Chain
- select标签中值的获取方法
- nvidia jetson 开发板运行 jetson-inference 出现问题的终极解决办法
- 顶部状态栏改变颜色
- bzoj 2588 树上主席树
- java动态代理机制--那些让你面试脱颖而出的技能
- 动态规划中级教程 646. Maximum Length of Pair Chain
- Android面试中值得深思的问题
- 未能加载文件或程序集“MySQLDriverCS”或它的某一个依赖项。试图加载格式不正确的程序
- 转义字符
- linux 切换Java版本不正确
- <转载>工程师们,不要想一辈子靠技术混饭吃
- CC2640R2F BLE5.0 蓝牙协议栈数据长度扩展功能(LE Data Length Extension)
- Y
- 跨域