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.
Note:
The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
题目等价为:检测图中是否有环
参考网址:LeetCode – Course Schedule (Java)
BFS:
// BFS
public static boolean canFinish(int numCourses, int[][] prerequisites) {
// 参数检查
if (prerequisites == null) {
return false;
}
int len = prerequisites.length;
if (numCourses <= 0 || len == 0) {
return true;
}
// 记录每个course的prerequisites的数量
int[] pCounter = new int[numCourses];
for (int i = 0; i < len; i++) {
pCounter[prerequisites[i][0]]++;
}
// 用队列记录可以直接访问的course
LinkedList<Integer> queue =