feat: update ts solution to lcp problem: No.07 (doocs#2609)

Author: thinkasany

lcp/LCP 07. 传递信息/README.md

@@ -123,7 +123,7 @@ func numWays(n int, relation [][]int, k int) int {
 
 ```ts
 function numWays(n: number, relation: number[][], k: number): number {
-    const f: number[][] = new Array(k + 1).fill(0).map(() => new Array(n).fill(0));
+    const f: number[][] = Array.from({ length: k + 1 }, () => Array(n).fill(0));
     f[0][0] = 1;
     for (let i = 1; i <= k; ++i) {
         for (const [a, b] of relation) {

lcp/LCP 07. 传递信息/Solution.ts

@@ -1,5 +1,5 @@
 function numWays(n: number, relation: number[][], k: number): number {
-    const f: number[][] = new Array(k + 1).fill(0).map(() => new Array(n).fill(0));
+    const f: number[][] = Array.from({ length: k + 1 }, () => Array(n).fill(0));
     f[0][0] = 1;
     for (let i = 1; i <= k; ++i) {
         for (const [a, b] of relation) {