提交210 课程表II

yllg · yllg · commit d9497a9b39d8 · 2019-11-13T21:08:47.000+08:00
diff --git a/210.课程表II/solution.html b/210.课程表II/solution.html
@@ -0,0 +1,63 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <meta http-equiv="X-UA-Compatible" content="ie=edge">
+    <title>Document</title>
+</head>
+<body>
+<script>
+// Source : https://leetcode.com/problems/course-schedule-ii/
+// Author : 悬笔e绝
+// Date   : 2019-11-13
+
+/**
+ * @param {number} numCourses
+ * @param {number[][]} prerequisites
+ * @return {number[]}
+ */
+var findOrder = function(numCourses, prerequisites) {
+  var map = []; // 邻接表
+  var indegree = []; // 入度
+
+  for (var i = 0; i < numCourses; i++)
+    map[i] = [], indegree[i] = 0;
+
+  prerequisites.forEach(function(item) {
+    var from = item[1];
+    var to = item[0];
+
+    map[from].push(to);
+    indegree[to]++;
+  });
+
+  var q = [];
+  var finishNum = 0;
+  var ans = [];
+
+  for (var i = 0; i < numCourses; i++) {
+    // 入度为 0，没有依赖
+    if (!indegree[i]) {
+      q.push(i);
+      finishNum++;
+    }
+  }
+
+  while (q.length) {
+    var from = q.shift();
+    ans.push(from);
+
+    map[from].forEach(function(to) {
+      if (--indegree[to] === 0) {
+        q.push(to);
+        finishNum++;
+      }
+    });
+  }
+
+  return finishNum === numCourses ? ans : [];
+};
+</script>
+</body>
+</html>
