feat: add python and java solutions to leetcode problem: No.1652

1652. Defuse the Bomb

Author: yanglbme

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

@@ -60,22 +60,55 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+数组下标取模，累加求每一项即可。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def decrypt(self, code: List[int], k: int) -> List[int]:
+        n = len(code)
+        res = [0] * n
+        if k == 0:
+            return res
+        for i in range(n):
+            if k > 0:
+                for j in range(i + 1, i + k + 1):
+                    res[i] += code[j % n]
+            else:
+                for j in range(i + k, i):
+                    res[i] += code[(j + n) % n]
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int[] decrypt(int[] code, int k) {
+        int n = code.length;
+        int[] res = new int[n];
+        if (k == 0) return res;
+        for (int i = 0; i < n; ++i) {
+            if (k > 0) {
+                for (int j = i + 1; j <= i + k; ++j) {
+                    res[i] += code[j % n];
+                }
+            } else {
+                for (int j = i + k; j <= i - 1; ++j) {
+                    res[i] += code[(j + n) % n];
+                }
+            }
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

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

@@ -60,13 +60,44 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def decrypt(self, code: List[int], k: int) -> List[int]:
+        n = len(code)
+        res = [0] * n
+        if k == 0:
+            return res
+        for i in range(n):
+            if k > 0:
+                for j in range(i + 1, i + k + 1):
+                    res[i] += code[j % n]
+            else:
+                for j in range(i + k, i):
+                    res[i] += code[(j + n) % n]
+        return res
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int[] decrypt(int[] code, int k) {
+        int n = code.length;
+        int[] res = new int[n];
+        if (k == 0) return res;
+        for (int i = 0; i < n; ++i) {
+            if (k > 0) {
+                for (int j = i + 1; j <= i + k; ++j) {
+                    res[i] += code[j % n];
+                }
+            } else {
+                for (int j = i + k; j <= i - 1; ++j) {
+                    res[i] += code[(j + n) % n];
+                }
+            }
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

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

@@ -0,0 +1,19 @@
+class Solution {
+    public int[] decrypt(int[] code, int k) {
+        int n = code.length;
+        int[] res = new int[n];
+        if (k == 0) return res;
+        for (int i = 0; i < n; ++i) {
+            if (k > 0) {
+                for (int j = i + 1; j <= i + k; ++j) {
+                    res[i] += code[j % n];
+                }
+            } else {
+                for (int j = i + k; j <= i - 1; ++j) {
+                    res[i] += code[(j + n) % n];
+                }
+            }
+        }
+        return res;
+    }
+}

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

@@ -0,0 +1,14 @@
+class Solution:
+    def decrypt(self, code: List[int], k: int) -> List[int]:
+        n = len(code)
+        res = [0] * n
+        if k == 0:
+            return res
+        for i in range(n):
+            if k > 0:
+                for j in range(i + 1, i + k + 1):
+                    res[i] += code[j % n]
+            else:
+                for j in range(i + k, i):
+                    res[i] += code[(j + n) % n]
+        return res