feat: update solutions to lc problem: No.1306

Author: thinkasany

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

@@ -164,6 +164,28 @@ func canReach(arr []int, start int) bool {
 }
 ```
 
+### **TypeScript**
+
+```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];
+        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

@@ -145,6 +145,28 @@ func canReach(arr []int, start int) bool {
 }
 ```
 
+### **TypeScript**
+
+```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];
+        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

@@ -0,0 +1,17 @@
+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];
+        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;
+}