Example 1:

Input: n = 5
Output: [-7,-1,1,3,4]
Explanation: These arrays also are accepted [-5,-1,1,2,3] , [-3,-1,2,-2,4].

Example 2:

Input: n = 3
Output: [-1,0,1]

Example 3:

Input: n = 1
Output: [0]

Constraints:

• 1 <= n <= 1000

Solution: Generation

Use numbers from {-n/2, … n/2} + {0 if n is odd}

Time complexity: O(n)
Space complexity: O(1)

// Author: Huahua
class Solution {
public:
  vector<int> sumZero(int n) {
    vector<int> ans;
    for (int i = 1; i <= n / 2; ++i) {
      ans.push_back(i);
      ans.push_back(-i);
    }
    if (ans.size() != n) ans.push_back(0);
    return ans;
  }
};

The post 花花酱 LeetCode 1304. Find N Unique Integers Sum up to Zero appeared first on Huahua's Tech Road.