leetcode 646. Maximum Length of Pair Chain
来源:互联网 发布:mac显示路径命令 编辑:程序博客网 时间:2024/06/05 04:10
class Solution {
public:
int findLongestChain(vector<vector<int>>& pairs) {
map<int,vector<int>> hash;
int size=(int)pairs.size();
for(int i=0;i<=size-1;i++)
hash[pairs[i][0]].push_back(pairs[i][1]);
vector<vector<int>> p;
for(auto n:hash)
{
for(int i=0;i<=n.second.size()-1;i++)
{
vector<int> k;
k.push_back(n.first);
k.push_back(n.second[i]);
p.push_back(k);
}
} //前面到这里都是为了排序,不知道怎么办只能这样了,滑稽
if(!size)
return0;
int res[size];
res[0]=1;
for(int i=1;i<=size-1;i++)
{
int result=1;
for(int j=0;j<=i-1;j++)
{
if(p[j][1]<p[i][0])
result= result>res[j]+1? result:res[j]+1;
}
res[i]=result;
}
return res[size-1];
}
};
- [leetcode]646. Maximum Length of Pair Chain
- leetcode 646. Maximum Length of Pair Chain
- LeetCode 646. Maximum Length of Pair Chain
- [Leetcode] 646. Maximum Length of Pair Chain
- leetcode 646. Maximum Length of Pair Chain
- [leetcode] 646. Maximum Length of Pair Chain
- [LeetCode] 646. Maximum Length of Pair Chain
- [LeetCode] 646. Maximum Length of Pair Chain
- LeetCode 646. Maximum Length of Pair Chain
- LeetCode:Maximum Length of Pair Chain
- [LeetCode]646. Maximum Length of Pair Chain<DP>
- leetcode 646. Maximum Length of Pair Chain(dp)
- 【LeetCode】646.Maximum Length of Pair Chain(Medium)解题报告
- LeetCode 646. Maximum Length of Pair Chain [Medium]
- Leetcode 646. Maximum Length of Pair Chain(算法分析week14)
- leetcode 646. Maximum Length of Pair Chain 最长连续元素
- 646. Maximum Length of Pair Chain
- 646. Maximum Length of Pair Chain
- [ Java学习 ] 破除思维定势之 C++ 和 Java 的差异 003
- 简易多线程服务器
- ElasticSearch 集群安装(5.5.2)
- JavaScript中的正则表达式
- 让instance使用hugepage
- leetcode 646. Maximum Length of Pair Chain
- 深度学习与AI+思维简单课程思考1
- H6机顶盒Android编译[1]-linux内核编译
- jsp页面传中文数据到Action中出现乱码
- SQL Server客户端工具到底使用的是哪个provider呢?
- 数据分析学习-增长思维
- nginx解决单点tomcat问题
- 数据结构实验之栈与队列一:进制转换
- 关于Jquery weui