题目地址:
leetcode.com/problems/co…
import java.util.*;
public class Solution {
public int[] findOrder(int numCourses, int[][] prerequisites) {
}
private Map<Integer, List<Integer>> buildGraph(int[][] prerequisites) {
Map<Integer, List<Integer>> map = new HashMap<>();
for (int[] prerequisite : prerequisites) {
map.putIfAbsent(prerequisite[1], new ArrayList<>());
map.get(prerequisite[1]).add(prerequisite[0]);
}
return map;
}
}
import java.util.*;
public class Solution {
public int[] findOrder(int numCourses, int[][] prerequisites) {
}
private Map<Integer, List<Integer>> buildGraph(int[][] prerequisites) {
Map<Integer, List<Integer>> map = new HashMap<>();
for (int[] prerequisite : prerequisites) {
map.putIfAbsent(prerequisite[1], new ArrayList<>());
map.get(prerequisite[1]).add(prerequisite[0]);
}
return map;
}
}