feat: add solutions to lc problem: No.1304

Author: thinkasany

solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/README.md

@@ -162,6 +162,30 @@ func sumZero(n int) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function sumZero(n: number): number[] {
+    const ans = new Array(n).fill(0);
+    for (let i = 1, j = 0; i <= n / 2; ++i) {
+        ans[j++] = i;
+        ans[j++] = -i;
+    }
+    return ans;
+}
+```
+
+```ts
+function sumZero(n: number): number[] {
+    const ans = new Array(n).fill(0);
+    for (let i = 1; i < n; ++i) {
+        ans[i] = i;
+    }
+    ans[0] = -((n * (n - 1)) / 2);
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/README_EN.md

@@ -143,6 +143,30 @@ func sumZero(n int) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function sumZero(n: number): number[] {
+    const ans = new Array(n).fill(0);
+    for (let i = 1, j = 0; i <= n / 2; ++i) {
+        ans[j++] = i;
+        ans[j++] = -i;
+    }
+    return ans;
+}
+```
+
+```ts
+function sumZero(n: number): number[] {
+    const ans = new Array(n).fill(0);
+    for (let i = 1; i < n; ++i) {
+        ans[i] = i;
+    }
+    ans[0] = -((n * (n - 1)) / 2);
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/Solution.ts

@@ -0,0 +1,8 @@
+function sumZero(n: number): number[] {
+    const ans = new Array(n).fill(0);
+    for (let i = 1; i < n; ++i) {
+        ans[i] = i;
+    }
+    ans[0] = -((n * (n - 1)) / 2);
+    return ans;
+}