feat: update ts solution to lc problem: No.0210 (#1594)

thinkasany · web-flow · commit ef737e6482c0 · 2023-09-10T23:48:00.000+08:00
diff --git a/solution/0200-0299/0210.Course Schedule II/README.md b/solution/0200-0299/0210.Course Schedule II/README.md
@@ -206,15 +206,15 @@ func findOrder(numCourses int, prerequisites [][]int) []int {
 
 ```ts
 function findOrder(numCourses: number, prerequisites: number[][]): number[] {
-    const g: number[][] = new Array(numCourses).fill(0).map(() => []);
+    const g: number[][] = Array.from({ length: numCourses }, () => []);
     const indeg: number[] = new Array(numCourses).fill(0);
     for (const [a, b] of prerequisites) {
         g[b].push(a);
         indeg[a]++;
     }
     const q: number[] = [];
     for (let i = 0; i < numCourses; ++i) {
-        if (indeg[i] == 0) {
+        if (indeg[i] === 0) {
             q.push(i);
         }
     }
@@ -223,7 +223,7 @@ function findOrder(numCourses: number, prerequisites: number[][]): number[] {
         const i = q.shift()!;
         ans.push(i);
         for (const j of g[i]) {
-            if (--indeg[j] == 0) {
+            if (--indeg[j] === 0) {
                 q.push(j);
             }
         }
diff --git a/solution/0200-0299/0210.Course Schedule II/README_EN.md b/solution/0200-0299/0210.Course Schedule II/README_EN.md
@@ -185,15 +185,15 @@ func findOrder(numCourses int, prerequisites [][]int) []int {
 
 ```ts
 function findOrder(numCourses: number, prerequisites: number[][]): number[] {
-    const g: number[][] = new Array(numCourses).fill(0).map(() => []);
+    const g: number[][] = Array.from({ length: numCourses }, () => []);
     const indeg: number[] = new Array(numCourses).fill(0);
     for (const [a, b] of prerequisites) {
         g[b].push(a);
         indeg[a]++;
     }
     const q: number[] = [];
     for (let i = 0; i < numCourses; ++i) {
-        if (indeg[i] == 0) {
+        if (indeg[i] === 0) {
             q.push(i);
         }
     }
@@ -202,7 +202,7 @@ function findOrder(numCourses: number, prerequisites: number[][]): number[] {
         const i = q.shift()!;
         ans.push(i);
         for (const j of g[i]) {
-            if (--indeg[j] == 0) {
+            if (--indeg[j] === 0) {
                 q.push(j);
             }
         }
diff --git a/solution/0200-0299/0210.Course Schedule II/Solution.ts b/solution/0200-0299/0210.Course Schedule II/Solution.ts
@@ -1,13 +1,13 @@
 function findOrder(numCourses: number, prerequisites: number[][]): number[] {
-    const g: number[][] = new Array(numCourses).fill(0).map(() => []);
+    const g: number[][] = Array.from({ length: numCourses }, () => []);
     const indeg: number[] = new Array(numCourses).fill(0);
     for (const [a, b] of prerequisites) {
         g[b].push(a);
         indeg[a]++;
     }
     const q: number[] = [];
     for (let i = 0; i < numCourses; ++i) {
-        if (indeg[i] == 0) {
+        if (indeg[i] === 0) {
             q.push(i);
         }
     }
@@ -16,7 +16,7 @@ function findOrder(numCourses: number, prerequisites: number[][]): number[] {
         const i = q.shift()!;
         ans.push(i);
         for (const j of g[i]) {
-            if (--indeg[j] == 0) {
+            if (--indeg[j] === 0) {
                 q.push(j);
             }
         }

Original file line number	Diff line number	Diff line change
`@@ -206,15 +206,15 @@ func findOrder(numCourses int, prerequisites [][]int) []int {`
`206`	`206`
`207`	`207`	```ts
`208`	`208`	`function findOrder(numCourses: number, prerequisites: number[][]): number[] {`
`209`		`- const g: number[][] = new Array(numCourses).fill(0).map(() => []);`
	`209`	`+ const g: number[][] = Array.from({ length: numCourses }, () => []);`
`210`	`210`	`const indeg: number[] = new Array(numCourses).fill(0);`
`211`	`211`	`for (const [a, b] of prerequisites) {`
`212`	`212`	`g[b].push(a);`
`213`	`213`	`indeg[a]++;`
`214`	`214`	`}`
`215`	`215`	`const q: number[] = [];`
`216`	`216`	`for (let i = 0; i < numCourses; ++i) {`
`217`		`- if (indeg[i] == 0) {`
	`217`	`+ if (indeg[i] === 0) {`
`218`	`218`	`q.push(i);`
`219`	`219`	`}`
`220`	`220`	`}`
`@@ -223,7 +223,7 @@ function findOrder(numCourses: number, prerequisites: number[][]): number[] {`
`223`	`223`	`const i = q.shift()!;`
`224`	`224`	`ans.push(i);`
`225`	`225`	`for (const j of g[i]) {`
`226`		`- if (--indeg[j] == 0) {`
	`226`	`+ if (--indeg[j] === 0) {`
`227`	`227`	`q.push(j);`
`228`	`228`	`}`
`229`	`229`	`}`
Original file line number	Diff line number	Diff line change
`@@ -185,15 +185,15 @@ func findOrder(numCourses int, prerequisites [][]int) []int {`
`185`	`185`
`186`	`186`	```ts
`187`	`187`	`function findOrder(numCourses: number, prerequisites: number[][]): number[] {`
`188`		`- const g: number[][] = new Array(numCourses).fill(0).map(() => []);`
	`188`	`+ const g: number[][] = Array.from({ length: numCourses }, () => []);`
`189`	`189`	`const indeg: number[] = new Array(numCourses).fill(0);`
`190`	`190`	`for (const [a, b] of prerequisites) {`
`191`	`191`	`g[b].push(a);`
`192`	`192`	`indeg[a]++;`
`193`	`193`	`}`
`194`	`194`	`const q: number[] = [];`
`195`	`195`	`for (let i = 0; i < numCourses; ++i) {`
`196`		`- if (indeg[i] == 0) {`
	`196`	`+ if (indeg[i] === 0) {`
`197`	`197`	`q.push(i);`
`198`	`198`	`}`
`199`	`199`	`}`
`@@ -202,7 +202,7 @@ function findOrder(numCourses: number, prerequisites: number[][]): number[] {`
`202`	`202`	`const i = q.shift()!;`
`203`	`203`	`ans.push(i);`
`204`	`204`	`for (const j of g[i]) {`
`205`		`- if (--indeg[j] == 0) {`
	`205`	`+ if (--indeg[j] === 0) {`
`206`	`206`	`q.push(j);`
`207`	`207`	`}`
`208`	`208`	`}`
Original file line number	Diff line number	Diff line change
`@@ -1,13 +1,13 @@`
`1`	`1`	`function findOrder(numCourses: number, prerequisites: number[][]): number[] {`
`2`		`- const g: number[][] = new Array(numCourses).fill(0).map(() => []);`
	`2`	`+ const g: number[][] = Array.from({ length: numCourses }, () => []);`
`3`	`3`	`const indeg: number[] = new Array(numCourses).fill(0);`
`4`	`4`	`for (const [a, b] of prerequisites) {`
`5`	`5`	`g[b].push(a);`
`6`	`6`	`indeg[a]++;`
`7`	`7`	`}`
`8`	`8`	`const q: number[] = [];`
`9`	`9`	`for (let i = 0; i < numCourses; ++i) {`
`10`		`- if (indeg[i] == 0) {`
	`10`	`+ if (indeg[i] === 0) {`
`11`	`11`	`q.push(i);`
`12`	`12`	`}`
`13`	`13`	`}`
`@@ -16,7 +16,7 @@ function findOrder(numCourses: number, prerequisites: number[][]): number[] {`
`16`	`16`	`const i = q.shift()!;`
`17`	`17`	`ans.push(i);`
`18`	`18`	`for (const j of g[i]) {`
`19`		`- if (--indeg[j] == 0) {`
	`19`	`+ if (--indeg[j] === 0) {`
`20`	`20`	`q.push(j);`
`21`	`21`	`}`
`22`	`22`	`}`