forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.cs
44 lines (41 loc) · 1.19 KB
/
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
34
35
36
37
38
39
40
41
42
43
44
using System.Collections.Generic;
public class Solution {
public bool CanFinish(int numCourses, int[][] prerequisites) {
var indegree = new int[numCourses];
var edgeCount = prerequisites.Length;
var edge = new List<int>[numCourses];
for (var i = 0; i < edgeCount; ++i)
{
var child = prerequisites[i][0];
var parent = prerequisites[i][1];
if (edge[parent] == null)
{
edge[parent] = new List<int>();
}
edge[parent].Add(child);
++indegree[child];
}
var queue = new Queue<int>();
for (var i = 0; i < numCourses; ++i)
{
if (indegree[i] == 0) queue.Enqueue(i);
}
var count = 0;
while (queue.Count > 0)
{
var node = queue.Dequeue();
++count;
if (edge[node] != null)
{
foreach (var next in edge[node])
{
if (--indegree[next] == 0)
{
queue.Enqueue(next);
}
}
}
}
return count == numCourses;
}
}