LeetCode *** 210. Course Schedule II
2016-04-25 20:34
330 查看
题目:
There are a total of n courses you have to take, labeled from
Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair:
Given the total number of courses and a list of prerequisite pairs, return the ordering of courses you should take to finish all courses.
There may be multiple correct orders, you just need to return one of them. If it is impossible to finish all courses, return an empty array.
For example:
There are a total of 2 courses to take. To take course 1 you should have finished course 0. So the correct course order is
There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0. So one correct course order is
Note:
The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about
how a graph is represented.
分析:
跑了1484ms。。。。。
代码:
There are a total of n courses you have to take, labeled from
0to
n - 1.
Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair:
[0,1]
Given the total number of courses and a list of prerequisite pairs, return the ordering of courses you should take to finish all courses.
There may be multiple correct orders, you just need to return one of them. If it is impossible to finish all courses, return an empty array.
For example:
2, [[1,0]]
There are a total of 2 courses to take. To take course 1 you should have finished course 0. So the correct course order is
[0,1]
4, [[1,0],[2,0],[3,1],[3,2]]
There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0. So one correct course order is
[0,1,2,3]. Another correct ordering is
[0,2,1,3].
Note:
The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about
how a graph is represented.
分析:
跑了1484ms。。。。。
代码:
class Solution { public: vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) { vector<int> res; unordered_map<int,set<int>> record; for(auto req:prerequisites) record[req.first].insert(req.second); queue<int> que; for(int i=0;i<numCourses;++i) if(record.find(i)==record.end())que.push(i); while(!que.empty()){ int tmp=que.front(); que.pop(); res.push_back(tmp); for(unordered_map<int,set<int>>::iterator it=record.begin();it!=record.end();++it) if(((*it).second).find(tmp)!=((*it).second).end()){ ((*it).second).erase(tmp); if(((*it).second).empty())que.push((*it).first); } } return res.size()==numCourses?res:vector<int>(); } };
相关文章推荐
- TCP协议详解
- 并行、并发、同步和互斥
- 采用dom实现复选框全选、取消效果
- HDU-1087 Super Jumping! Jumping! Jumping!( DP )
- ElasticSearch Search API 简介
- render用法
- Solr安装笔记
- mysql基础(三)
- 科技辅导员,信息化助力成长
- git status中很多带#的untrack文件
- textarea中文提交乱码问题解决
- SetThreadContext注入DLL
- scanf那些事
- (2.2.9.3)groovy的闭包
- 复杂网络数据网站+程序代码网站
- C++预编译头文件(#include "stdafx.h")
- web.xml文件详解
- LeetCode------Delete Node in a Linked List
- 杭电 1231 1003 最大连续子序列
- 如何使用Linux的Crontab定时执行PHP脚本的方法