add 1652

fishercoder1534 · fishercoder1534 · commit d948bb6f0f13 · 2020-11-14T09:50:50.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1652|[Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1652.java) ||Easy|Array|
 |1640|[Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1640.java) ||Easy|Array, Sort|
 |1637|[Widest Vertical Area Between Two Points Containing No Points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/)|[Javascript](./javascript/_1637.js)| | Medium | Sort |
 |1636|[Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1636.java) ||Easy|Array, Sort|
diff --git a/src/main/java/com/fishercoder/solutions/_1652.java b/src/main/java/com/fishercoder/solutions/_1652.java
@@ -0,0 +1,39 @@
+package com.fishercoder.solutions;
+
+public class _1652 {
+    public static class Solution1 {
+        public int[] decrypt(int[] code, int k) {
+            int[] result = new int[code.length];
+            int len = code.length;
+            if (k == 0) {
+                for (int i = 0; i < code.length; i++) {
+                    result[i] = 0;
+                }
+            } else if (k > 0) {
+                int kSum = 0;
+                for (int i = 1; i <= k; i++) {
+                    kSum += code[i];
+                }
+                result[0] = kSum;
+                for (int i = 1; i < len; i++) {
+                    kSum -= code[i];
+                    kSum += code[(i + k) % len];
+                    result[i] = kSum;
+                }
+            } else {
+                int kSum = 0;
+                int kVal = Math.abs(k);
+                for (int i = len - 1; i >= len - kVal; i--) {
+                    kSum += code[i];
+                }
+                result[0] = kSum;
+                for (int i = 1; i < len; i++) {
+                    kSum -= code[(len - kVal + i - 1) % len];
+                    kSum += code[i - 1];
+                    result[i] = kSum;
+                }
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1652Test.java b/src/test/java/com/fishercoder/_1652Test.java
@@ -0,0 +1,42 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1652;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1652Test {
+    private static _1652.Solution1 solution1;
+    private static int[] code;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1652.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        code = new int[]{5, 7, 1, 4};
+        assertArrayEquals(new int[]{12, 10, 16, 13}, solution1.decrypt(code, 3));
+    }
+
+    @Test
+    public void test2() {
+        code = new int[]{1, 2, 3, 4};
+        assertArrayEquals(new int[]{0, 0, 0, 0}, solution1.decrypt(code, 0));
+    }
+
+    @Test
+    public void test3() {
+        code = new int[]{2, 4, 9, 3};
+        assertArrayEquals(new int[]{12, 5, 6, 13}, solution1.decrypt(code, -2));
+    }
+
+    @Test
+    public void test4() {
+        code = new int[]{10, 5, 7, 7, 3, 2, 10, 3, 6, 9, 1, 6};
+        assertArrayEquals(new int[]{22, 26, 22, 28, 29, 22, 19, 22, 18, 21, 28, 19}, solution1.decrypt(code, -4));
+    }
+
+}
