210. Course Schedule II

public class Solution {
    public int[] findOrder(int numCourses, int[][] prerequisites) {
        int[] indegrees=new int[numCourses];
        int[] order=new int[numCourses];
        int k=0;
        Queue queue=new LinkedList<>();
        for(int[] pair:prerequisites){
            indegrees[pair[0]]++;
        }
        for(int i=0;i

你可能感兴趣的:(210. Course Schedule II)