leetcode

commit e70ec56060a9085a0847d3014c5aecdb0298830a
parent 8eca342b99ab30a60285fc842f0229ab60ba2bcc
Author: Jack Sangdahl <jack@pngu.org>
Date:   Sat,  6 Sep 2025 20:58:35 -0600

1304. find n unique integers sum up to zero

Diffstat:
A
find_n_unique_int_sum_0.c
 | 
33
+++++++++++++++++++++++++++++++++
A
find_n_unique_int_sum_0.py
 | 
22
++++++++++++++++++++++

2 files changed, 55 insertions(+), 0 deletions(-)
diff --git a/find_n_unique_int_sum_0.c b/find_n_unique_int_sum_0.c
@@ -0,0 +1,33 @@
+// 1304. Find N Unique Integers Sum up to Zero
+#include "leetcode.h"
+
+/*
+ * given an integer 'n', return any array containing 'n' unique integers such
+ * that they add up to 0.
+ */
+
+int *sumZero(int n, int *returnSize) {
+  int *ans = (int *)malloc(n * sizeof(int));
+  *returnSize = n;
+  for (int i = 0; i < n; ++i)
+    ans[i] = i * 2 - n + 1;
+  return ans;
+}
+
+int main() {
+  int rs1, *sz1 = sumZero(5, &rs1);
+  int rs2, *sz2 = sumZero(3, &rs2);
+  int rs3, *sz3 = sumZero(1, &rs3);
+  for (int i = 0; i < rs1; i++)
+    printf("%d ", sz1[i]); // expect: -7 -1 1 3 4
+  printf("\n");
+  for (int i = 0; i < rs2; i++)
+    printf("%d ", sz2[i]); // expect: -1 0 1
+  printf("\n");
+  for (int i = 0; i < rs3; i++)
+    printf("%d ", sz3[i]); // expect: 0
+  printf("\n");
+  free(sz1);
+  free(sz2);
+  free(sz3);
+}
diff --git a/find_n_unique_int_sum_0.py b/find_n_unique_int_sum_0.py
@@ -0,0 +1,22 @@
+# 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.
+"""
+
+
+class Solution(object):
+    def sumZero(self, n):
+        """
+        :type n: int
+        :rtype: List[int]
+        """
+        return range(1 - n, n, 2)
+
+
+if __name__ == "__main__":
+    obj = Solution()
+    print(obj.sumZero(5))
+    print(obj.sumZero(3))
+    print(obj.sumZero(1))