refactor: update TS solution to lc problem: No.1306

Author: rain84

solution/1300-1399/1306.Jump Game III/README.md

@@ -180,20 +180,18 @@ func canReach(arr []int, start int) bool {
 
 ```ts
 function canReach(arr: number[], start: number): boolean {
-    const q: number[] = [start];
-    while (q.length) {
-        const i: number = q.shift()!;
-        if (arr[i] === 0) {
-            return true;
-        }
-        const x: number = arr[i];
+    const q = [start];
+
+    for (const i of q) {
+        if (arr[i] === 0) return true;
+        if (arr[i] === -1 || arr[i] === undefined) continue;
+
+        q.push(i + arr[i]);
+        q.push(i - arr[i]);
+
         arr[i] = -1;
-        for (const j of [i + x, i - x]) {
-            if (j >= 0 && j < arr.length && arr[j] !== -1) {
-                q.push(j);
-            }
-        }
     }
+
     return false;
 }
 ```

solution/1300-1399/1306.Jump Game III/README_EN.md

@@ -169,20 +169,18 @@ func canReach(arr []int, start int) bool {
 
 ```ts
 function canReach(arr: number[], start: number): boolean {
-    const q: number[] = [start];
-    while (q.length) {
-        const i: number = q.shift()!;
-        if (arr[i] === 0) {
-            return true;
-        }
-        const x: number = arr[i];
+    const q = [start];
+
+    for (const i of q) {
+        if (arr[i] === 0) return true;
+        if (arr[i] === -1 || arr[i] === undefined) continue;
+
+        q.push(i + arr[i]);
+        q.push(i - arr[i]);
+
         arr[i] = -1;
-        for (const j of [i + x, i - x]) {
-            if (j >= 0 && j < arr.length && arr[j] !== -1) {
-                q.push(j);
-            }
-        }
     }
+
     return false;
 }
 ```

solution/1300-1399/1306.Jump Game III/Solution.ts

@@ -1,17 +1,15 @@
 function canReach(arr: number[], start: number): boolean {
-    const q: number[] = [start];
-    while (q.length) {
-        const i: number = q.shift()!;
-        if (arr[i] === 0) {
-            return true;
-        }
-        const x: number = arr[i];
+    const q = [start];
+
+    for (const i of q) {
+        if (arr[i] === 0) return true;
+        if (arr[i] === -1 || arr[i] === undefined) continue;
+
+        q.push(i + arr[i]);
+        q.push(i - arr[i]);
+
         arr[i] = -1;
-        for (const j of [i + x, i - x]) {
-            if (j >= 0 && j < arr.length && arr[j] !== -1) {
-                q.push(j);
-            }
-        }
     }
+
     return false;
 }