Minimum Number of Vertices to Reach All Nodes LeetCode solution in Java

1
class Solution {
2
  public List<Integer> findSmallestSetOfVertices(int n, List<List<Integer>> edges) {
3

4
    int[] indegree = new int[n];
5

6
    for (List<Integer> edge : edges) {
7
      indegree[edge.get(1)]++;
8
    }
9

10
    List<Integer> result = new ArrayList<>();
11

12
    for (int i = 0; i < n; i++) {
13
      if (indegree[i] == 0) result.add(i);
14
    }
15

16
    return result;
17
  }
18
}