Output: [-1,0,1]

Example 3

Input: n = 1
Output: [0]

Constraints

1 <= n <= 1000

Solution

Method 1 – Symmetric Construction

Intuition

To get n unique integers that sum to zero, we can pair numbers symmetrically around zero (e.g., -1 and 1, -2 and 2, ...). If n is odd, include 0 as well.

Approach

Initialize an empty list.
For i from 1 to n//2, add -i and i to the list.
If n is odd, add 0 to the list.
Return the list.

Code

[{"language":"C++","code":"class Solution {\npublic:\n    vector<int> sumZero(int n) {\n        vector<int> ans;\n        for (int i = 1; i <= n/2; ++i) {\n            ans.push_back(i);\n            ans.push_back(-i);\n        }\n        if (n % 2 == 1) ans.push_back(0);\n        return ans;\n    }\n};","lang":"cpp","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">class</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> Solution</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">public:</span></span>\n<span class=\"line\"><span style=\"color:#6F42C1;--shiki-dark:#B392F0\">    vector</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">&#x3C;</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">> </span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\">sumZero</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#E36209;--shiki-dark:#FFAB70\"> n</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">) {</span></span>\n<span class=\"line\"><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">        vector</span><span style

Related Tags