646. Maximum Length of Pair Chain
来源:互联网 发布:spss数据信度分析 编辑:程序博客网 时间:2024/06/05 09:16
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].
- 这道题目不用dp,采用排序即可完成。
class Solution { public: int findLongestChain(vector<vector<int>>& pairs) { sort(pairs.begin(), pairs.end(), cmp); int cnt = 0; vector<int>& pair = pairs[0]; for (int i = 0; i < pairs.size(); i++) { if (i == 0 || pairs[i][0] > pair[1]) { pair = pairs[i]; cnt++; } } return cnt; } private: static bool cmp(vector<int>& a, vector<int>&b) { return a[1] < b[1] || a[1] == b[1] && a[0] < b[0]; }/*按照a[0]的大小来排序*/};
阅读全文
0 0
- 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
- 646. Maximum Length of Pair Chain
- LeetCode 646. Maximum Length of Pair Chain
- 关于clob字段的使用 "ORA-22835:缓冲区对于CLOB到CHAR转换而言太小"异常
- Multiframe CONNECT Edition v21.10.00.39 Win64 1CD
- 关于adapter 多次打印getView问题,解决方案
- 第五周【项目2
- 为什么互联网公司不开除测试工程师?
- 646. Maximum Length of Pair Chain
- Java四种引用包括强引用,软引用,弱引用,虚引用
- Ajax工作原理
- 第五周 【项目1
- 线下活动 | 揭秘大数据背后的京东虚拟平台(免费报名中)
- 如何为运行的 ARM Linux 启用 LAD2.3 版本的诊断扩展
- 理解JSONP
- 北京 | PMCAFF年度老友会本周开始,老伙伴们聚起来!
- 【创业公司的机遇与挑战】如何在1年内从产品助理到产品高管?