先用数组来存储课程的入度,再用队列用来排序,并防止重复入队,遍历indegree中入度为-1的数量,和课程数一样就返回true,否则返回false。
class Solution {
public boolean canFinish(int numCourses, int[][] prerequisites) {
int[] indegree = new int[numCourses];
Queue<Integer> queue = new LinkedList<>();
for (int[] arr : prerequisites)
indegree[arr[0]]++;
for (int i = 0; i < indegree.length; i++)
if (indegree[i] == 0)
{
queue.add(i);
indegree[i] --;
}
while (!queue.isEmpty())
{
int course = queue.poll();
for (int[] arr : prerequisites)
if (arr[1] == course)
indegree[arr[0]]--;
for(int i = 0; i < indegree.length; i++)
if (indegree[i] == 0)
{
queue.add(i);
indegree[i] = -1;
}
}
int res = 0;
for(int i = 0; i < indegree.length; i++)
if (indegree[i] == -1)
res++;
return res == numCourses ? true : false;
}
}