add 1304

fishercoder1534 · fishercoder1534 · commit 66611fb8d9c7 · 2019-12-29T08:35:17.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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1304|[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1304.java) | |Easy||
 |1302|[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1302.java) | |Medium||
 |1300|[Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1300.java) | |Medium||
 |1299|[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1299.java) | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1304.java b/src/main/java/com/fishercoder/solutions/_1304.java
@@ -0,0 +1,38 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1304. Find N Unique Integers Sum up to Zero
+ *
+ * Given an integer n, return any array containing n unique integers such that they add up to 0.
+ *
+ * Example 1:
+ * Input: n = 5
+ * Output: [-7,-1,1,3,4]
+ * Explanation: These arrays also are accepted [-5,-1,1,2,3] , [-3,-1,2,-2,4].
+ *
+ * Example 2:
+ * Input: n = 3
+ * Output: [-1,0,1]
+ *
+ * Example 3:
+ * Input: n = 1
+ * Output: [0]
+ * */
+public class _1304 {
+    public static class Solution1 {
+        public int[] sumZero(int n) {
+            int[] result = new int[n];
+            int start = -n / 2;
+            for (int i = 0; i < n / 2; i++) {
+                result[i] = start++;
+            }
+            if (n % 2 == 0) {
+                start++;
+            }
+            for (int i = n / 2; i < n; i++) {
+                result[i] = start++;
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1304Test.java b/src/test/java/com/fishercoder/_1304Test.java
@@ -0,0 +1,21 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._1304;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+public class _1304Test {
+    private static _1304.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1304.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        CommonUtils.printArray(solution1.sumZero(5));
+    }
+
+}
