feat: update ts solution to lc problem: No.1654 (doocs#1545)

Author: thinkasany

solution/1600-1699/1654.Minimum Jumps to Reach Home/README.md

@@ -241,9 +241,7 @@ function minimumJumps(
     const s: Set<number> = new Set(forbidden);
     const q: [number, number][] = [[0, 1]];
     const n = 6000;
-    const vis: boolean[][] = Array(n)
-        .fill(0)
-        .map(() => Array(2).fill(false));
+    const vis: boolean[][] = Array.from({ length: n }, () => [false, false]);
     vis[0][1] = true;
     for (let ans = 0; q.length; ++ans) {
         for (let t = q.length; t; --t) {

solution/1600-1699/1654.Minimum Jumps to Reach Home/README_EN.md

@@ -212,9 +212,7 @@ function minimumJumps(
     const s: Set<number> = new Set(forbidden);
     const q: [number, number][] = [[0, 1]];
     const n = 6000;
-    const vis: boolean[][] = Array(n)
-        .fill(0)
-        .map(() => Array(2).fill(false));
+    const vis: boolean[][] = Array.from({ length: n }, () => [false, false]);
     vis[0][1] = true;
     for (let ans = 0; q.length; ++ans) {
         for (let t = q.length; t; --t) {

solution/1600-1699/1654.Minimum Jumps to Reach Home/Solution.ts

@@ -7,9 +7,7 @@ function minimumJumps(
     const s: Set<number> = new Set(forbidden);
     const q: [number, number][] = [[0, 1]];
     const n = 6000;
-    const vis: boolean[][] = Array(n)
-        .fill(0)
-        .map(() => Array(2).fill(false));
+    const vis: boolean[][] = Array.from({ length: n }, () => [false, false]);
     vis[0][1] = true;
     for (let ans = 0; q.length; ++ans) {
         for (let t = q.length; t; --t) {