feat: add typescript solution to lc problem: No.0207

No.0207.Course Schedule

Author: zhaocchen

solution/0200-0299/0207.Course Schedule/README.md

@@ -117,6 +117,40 @@ class Solution {
 }
 ```
 
+### **TypeScrpt**
+
+```ts
+function canFinish(numCourses: number, prerequisites: number[][]): boolean {
+    let edges: number[][] = Array.from({ length: numCourses }, () => ([]));
+    let indeg = new Array(numCourses).fill(0);
+
+    for (let [b, a] of prerequisites) {
+        edges[a].push(b);
+        indeg[b] += 1;
+    }
+
+    let queue = [];
+    for (let i = 0; i < numCourses; i++) {
+        if (!indeg[i]) {
+            queue.push(i);
+        }
+    }
+
+    let visited: number = 0;
+    while (queue.length) {
+        visited += 1;
+        const u = queue.shift();
+        for (let v of edges[u]) {
+            indeg[v] -= 1;
+            if (!indeg[v]) {
+                queue.push(v);
+            }
+        }
+    }
+    return visited == numCourses;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0200-0299/0207.Course Schedule/README_EN.md

@@ -107,6 +107,40 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function canFinish(numCourses: number, prerequisites: number[][]): boolean {
+    let edges: number[][] = Array.from({ length: numCourses }, () => ([]));
+    let indeg = new Array(numCourses).fill(0);
+
+    for (let [b, a] of prerequisites) {
+        edges[a].push(b);
+        indeg[b] += 1;
+    }
+
+    let queue = [];
+    for (let i = 0; i < numCourses; i++) {
+        if (!indeg[i]) {
+            queue.push(i);
+        }
+    }
+
+    let visited: number = 0;
+    while (queue.length) {
+        visited += 1;
+        const u = queue.shift();
+        for (let v of edges[u]) {
+            indeg[v] -= 1;
+            if (!indeg[v]) {
+                queue.push(v);
+            }
+        }
+    }
+    return visited == numCourses;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0200-0299/0207.Course Schedule/Solution.ts

@@ -0,0 +1,29 @@
+function canFinish(numCourses: number, prerequisites: number[][]): boolean {
+    let edges: number[][] = Array.from({ length: numCourses }, () => ([]));
+    let indeg = new Array(numCourses).fill(0);
+
+    for (let [b, a] of prerequisites) {
+        edges[a].push(b);
+        indeg[b] += 1;
+    }
+
+    let queue = [];
+    for (let i = 0; i < numCourses; i++) {
+        if (!indeg[i]) {
+            queue.push(i);
+        }
+    }
+
+    let visited: number = 0;
+    while (queue.length) {
+        visited += 1;
+        const u = queue.shift();
+        for (let v of edges[u]) {
+            indeg[v] -= 1;
+            if (!indeg[v]) {
+                queue.push(v);
+            }
+        }
+    }
+    return visited == numCourses;
+};