-
Notifications
You must be signed in to change notification settings - Fork 7
/
Main.java
37 lines (33 loc) · 1.07 KB
/
Main.java
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
package com.company;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
// write your code here
}
public boolean canFinish(int numCourses, int[][] prerequisites) {
int[] inDegree = new int[numCourses];
ArrayList<Integer> graph[] = new ArrayList[numCourses];
for (int i = 0; i < numCourses; i++)
graph[i] = new ArrayList<>();
for (int[] p : prerequisites) {
graph[p[1]].add(p[0]);
inDegree[p[0]]++;
}
ArrayDeque<Integer> queue = new ArrayDeque<>();
for (int i = 0; i < inDegree.length; i++) {
if (inDegree[i] == 0)
queue.add(i);
}
while (!queue.isEmpty()) {
int cur = queue.poll();
for (int next : graph[cur]) {
inDegree[next]--;
if (inDegree[next] == 0)
queue.add(next);
}
}
return Arrays.stream(inDegree).allMatch(x -> x == 0);
}
}