feat: add ts solution to lc problem: No.1652

No.1652.Defuse the Bomb

Author: YangFong

solution/1600-1699/1652.Defuse the Bomb/README.md

@@ -282,6 +282,42 @@ func decrypt(code []int, k int) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function decrypt(code: number[], k: number): number[] {
+    const n = code.length;
+    if (k === 0) {
+        return code.fill(0);
+    }
+    const isPrefix = k < 0;
+    if (isPrefix) {
+        k *= -1;
+    }
+    const map = new Map<number, [number, number]>();
+    let prefix = 0;
+    let suffix = 0;
+    for (let i = 1; i <= k; i++) {
+        prefix += code[n - i];
+        suffix += code[i];
+    }
+    map.set(0, [prefix, suffix]);
+
+    for (let i = 1; i < n; i++) {
+        let [p, s] = map.get(i - 1);
+        p -= code[n - k - 1 + i] ?? code[i - k - 1];
+        p += code[i - 1];
+        s -= code[i];
+        s += code[i + k] ?? code[i + k - n];
+        map.set(i, [p, s]);
+    }
+    for (let i = 0; i < n; i++) {
+        code[i] = map.get(i)[Number(!isPrefix)];
+    }
+    return code;
+}
+```
+
 ### **...**
 
 ```

solution/1600-1699/1652.Defuse the Bomb/README_EN.md

@@ -240,6 +240,42 @@ func decrypt(code []int, k int) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function decrypt(code: number[], k: number): number[] {
+    const n = code.length;
+    if (k === 0) {
+        return code.fill(0);
+    }
+    const isPrefix = k < 0;
+    if (isPrefix) {
+        k *= -1;
+    }
+    const map = new Map<number, [number, number]>();
+    let prefix = 0;
+    let suffix = 0;
+    for (let i = 1; i <= k; i++) {
+        prefix += code[n - i];
+        suffix += code[i];
+    }
+    map.set(0, [prefix, suffix]);
+
+    for (let i = 1; i < n; i++) {
+        let [p, s] = map.get(i - 1);
+        p -= code[n - k - 1 + i] ?? code[i - k - 1];
+        p += code[i - 1];
+        s -= code[i];
+        s += code[i + k] ?? code[i + k - n];
+        map.set(i, [p, s]);
+    }
+    for (let i = 0; i < n; i++) {
+        code[i] = map.get(i)[Number(!isPrefix)];
+    }
+    return code;
+}
+```
+
 ### **...**
 
 ```

solution/1600-1699/1652.Defuse the Bomb/Solution.ts

@@ -0,0 +1,31 @@
+function decrypt(code: number[], k: number): number[] {
+    const n = code.length;
+    if (k === 0) {
+        return code.fill(0);
+    }
+    const isPrefix = k < 0;
+    if (isPrefix) {
+        k *= -1;
+    }
+    const map = new Map<number, [number, number]>();
+    let prefix = 0;
+    let suffix = 0;
+    for (let i = 1; i <= k; i++) {
+        prefix += code[n - i];
+        suffix += code[i];
+    }
+    map.set(0, [prefix, suffix]);
+
+    for (let i = 1; i < n; i++) {
+        let [p, s] = map.get(i - 1);
+        p -= code[n - k - 1 + i] ?? code[i - k - 1];
+        p += code[i - 1];
+        s -= code[i];
+        s += code[i + k] ?? code[i + k - n];
+        map.set(i, [p, s]);
+    }
+    for (let i = 0; i < n; i++) {
+        code[i] = map.get(i)[Number(!isPrefix)];
+    }
+    return code;
+}