###### LeetCode-Course Schedule-解题报告

There are a total of n courses you have to take, labeled from 0 to 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<vector<int> >graph(numCourses);
vector<int>out(numCourses, 0);
int num = 0;
vector<bool>vis(numCourses, 0);
for (auto &p : prerequisites)
graph[p.second].push_back(p.first), out[p.first]++;
dfs(graph, num, vis, out);
return num == numCourses;
}
void dfs(vector<vector<int> >& g, int& num, vector<bool>& vis, vector<int>& out)
{
if (num == g.size())return;
for (int i = 0; i < g.size(); ++i)
{
if (!vis[i] && out[i] == 0)
{
num++;
vis[i] = true;
for (int j = 0; j < g[i].size(); ++j)
--out[g[i][j]];
dfs(g, num, vis, out);
}
}
}
};

#### poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告

2009年10月06日 9KB 下载

#### leetcode-Course Schedule

2015-05-06 23:40:53

#### laravel定时任务

2017-12-05 17:23:59

#### 每天laravel-20160713|ScheduleRunCommand

2016-04-14 09:42:41

#### **LeetCode-Course Schedule

2015-09-29 09:43:48

#### NOIP2016提高组复赛解题报告

2016-11-27 22:28:49

#### C语言解题报告模板

2016-09-17 11:10:44

#### ZOJ解题报告ZOJ解题报告

2010年08月02日 282KB 下载

#### acm解题报告.rar

2009年03月18日 10MB 下载

#### schedule-调度器

2017-04-13 17:46:42

## 不良信息举报

LeetCode-Course Schedule-解题报告