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

1
/**
2
 * @param {number} n
3
 * @param {number[][]} edges
4
 * @return {number[]}
5
 */
6
var findSmallestSetOfVertices = function (n, edges) {
7
  let indegree = [];
8
  for (let i = 0; i < n; i++) {
9
    indegree.push(0);
10
  }
11
  let ans = [];
12
  for (const arr of edges) {
13
    indegree[arr[1]]++;
14
  }
15
  for (let i = 0; i < n; i++) {
16
    if (indegree[i] == 0) {
17
      ans.push(i);
18
    }
19
  }
20
  return ans;
21
};