solves find n unique integers sum up to zero

Author: anishLearnsToCode

README.md

@@ -335,7 +335,7 @@
 | 1290 | [Convert Binary Number In A Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer)                 |                                                [![Java](assets/java.png)](src/ConvertBinaryNumberInLinkedListToInteger.java)                                                |                                                                                                                                   |
 | 1295 | [Find Numbers With Even Numbers of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits)                                    |                                                                                                                                                                             |                                                                                                                                   |
 | 1299 | [Replace Elements With Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side)           |                                                                                                                                                                             |                                                                                                                                   |
-| 1304 | [Find N Unique Integers Sum Up To Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero)                                         |                                                                                                                                                                             |                                                                                                                                   |
+| 1304 | [Find N Unique Integers Sum Up To Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero)                                         |                                                     [![Java](assets/java.png)](src/FindNUniqueIntegersSumUpToZero.java)                                                     |                                                                                                                                   |
 | 1309 | [Decrypt String From Alphabet To Integer Mapping](https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping)                     |                                                                                                                                                                             |                                                                                                                                   |
 | 1313 | [Decompress Run-Length Encoded Strings](https://leetcode.com/problems/decompress-run-length-encoded-list)                                            |                                                                                                                                                                             |                                                                                                                                   |
 | 1317 | [Convert Integer to Sum Of Two Non-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers)                  |                                                                                                                                                                             |                                                                                                                                   |

src/FindNUniqueIntegersSumUpToZero.java

@@ -0,0 +1,11 @@
+public class FindNUniqueIntegersSumUpToZero {
+    public int[] sumZero(int n) {
+        final int[] result = new int[n];
+        for (int i = 0, k = 1 ; i + 1 < result.length ; i += 2, k++) {
+            result[i] = k;
+            result[i + 1] = -k;
+        }
+        if ((n & 1) == 1) result[n - 1] = 0;
+        return result;
+    }
+}