diff options
author | Jack Sangdahl <[email protected]> | 2025-09-06 20:58:35 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-09-06 20:58:35 -0600 |
commit | e70ec56060a9085a0847d3014c5aecdb0298830a (patch) | |
tree | 5a28e80a73fa2b066de4d66c38867f269553ece8 /find_n_unique_int_sum_0.c | |
parent | 8eca342b99ab30a60285fc842f0229ab60ba2bcc (diff) | |
download | leetcode-e70ec56060a9085a0847d3014c5aecdb0298830a.tar.gz leetcode-e70ec56060a9085a0847d3014c5aecdb0298830a.zip |
1304. find n unique integers sum up to zero
Diffstat (limited to 'find_n_unique_int_sum_0.c')
-rw-r--r-- | find_n_unique_int_sum_0.c | 33 |
1 files changed, 33 insertions, 0 deletions
diff --git a/find_n_unique_int_sum_0.c b/find_n_unique_int_sum_0.c new file mode 100644 index 0000000..d08bbd4 --- /dev/null +++ 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); +} |