forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.cs
33 lines (33 loc) · 925 Bytes
/
Solution.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
public class Solution {
public bool CanFinish(int numCourses, int[][] prerequisites) {
var edges = new List<int>[numCourses];
for (int i = 0; i < numCourses; ++i)
{
edges[i] = new List<int>();
}
var indegree = new int[numCourses];
for (int i = 0; i < prerequisites.Length; ++i)
{
int a = prerequisites[i][0];
int b = prerequisites[i][1];
edges[b].Add(a);
++indegree[a];
}
var q = new Queue<int>();
for (int i = 0; i < numCourses; ++i)
{
if (indegree[i] == 0) q.Enqueue(i);
}
var n = 0;
while (q.Count > 0)
{
int b = q.Dequeue();
++n;
foreach (int a in edges[b])
{
if (--indegree[a] == 0) q.Enqueue(a);
}
}
return n == numCourses;
}
}