leetcode之Course Schedule
2016-03-12 20:24
465 查看
题目:
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, is it possible for you to finish all courses?
For example:
There are a total of 2 courses to take. To take course 1 you should have finished course 0. So it is possible.
There are a total of 2 courses to take. To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. So it is impossible.
解答:
题目很明显是一个图,利用拓扑排序可以确定是不是能够进行完成上课
class Solution {
public:
bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
vector<int> indegree(numCourses,0);
int size = prerequisites.size();
if(size == 1 || size == 0)
return true;
map<int, vector<int>>m;
for(int i = 0;i < size;++i)
{
indegree[prerequisites[i].first]++;
m[prerequisites[i].second].push_back(prerequisites[i].first);
}
int cnt = 0;
queue<int> q;
for(int i = 0;i < numCourses;++i)
{
if(indegree[i] == 0)
q.push(i);
}
while(!q.empty())
{
int s = q.size();
while(s--)
{
int tmp = q.front();
q.pop();
cnt++;
for(int j = 0;j < m[tmp].size(); ++j)
{
indegree[m[tmp][j]]--;
}
indegree[tmp]--;
}
for(int i = 0;i < numCourses; ++i)
{
if(indegree[i] == 0)
q.push(i);
}
}
return numCourses == cnt ? true :false;
}
};
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, is it possible for you to finish all courses?
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 it is possible.
2, [[1,0],[0,1]]
There are a total of 2 courses to take. To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. So it is impossible.
解答:
题目很明显是一个图,利用拓扑排序可以确定是不是能够进行完成上课
class Solution {
public:
bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
vector<int> indegree(numCourses,0);
int size = prerequisites.size();
if(size == 1 || size == 0)
return true;
map<int, vector<int>>m;
for(int i = 0;i < size;++i)
{
indegree[prerequisites[i].first]++;
m[prerequisites[i].second].push_back(prerequisites[i].first);
}
int cnt = 0;
queue<int> q;
for(int i = 0;i < numCourses;++i)
{
if(indegree[i] == 0)
q.push(i);
}
while(!q.empty())
{
int s = q.size();
while(s--)
{
int tmp = q.front();
q.pop();
cnt++;
for(int j = 0;j < m[tmp].size(); ++j)
{
indegree[m[tmp][j]]--;
}
indegree[tmp]--;
}
for(int i = 0;i < numCourses; ++i)
{
if(indegree[i] == 0)
q.push(i);
}
}
return numCourses == cnt ? true :false;
}
};
相关文章推荐
- 只有程序员看的懂的面试圣经|如何拿下编程面试
- 下一次技术面试时要问的 3 个重要问题
- 书评:《算法之美( Algorithms to Live By )》
- 动易2006序列号破解算法公布
- Ruby实现的矩阵连乘算法
- C#插入法排序算法实例分析
- PHP程序员面试 切忌急功近利(更需要注重以后的发展)
- 超大数据量存储常用数据库分表分库算法总结
- C#数据结构与算法揭秘二
- C#冒泡法排序算法实例分析
- 算法练习之从String.indexOf的模拟实现开始
- C#算法之关于大牛生小牛的问题
- C#实现的算24点游戏算法实例分析
- c语言实现的带通配符匹配算法
- 浅析STL中的常用算法
- 算法之排列算法与组合算法详解
- C++实现一维向量旋转算法
- Ruby实现的合并排序算法
- C#折半插入排序算法实现方法
- 基于C++实现的各种内部排序算法汇总