Find N Unique Integers Sum up to Zero · LeetCode Site Generator

Description

Given an integer n, return any array containing n unique integers such that they add up to 0.

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(javascript)

/**
 * @param {number} n
 * @return {number[]}
 */
const sumZero = function (n) {
  let current = 0
  const result = []
  const negativeCount = Math.floor(n / 2)
  for (let i = negativeCount; i >= 1; i--) {
    result.push(-i)
    current += -i
  }
  for (let i = 1; i < n - negativeCount; i++) {
    current += i
    result.push(i)
  }
  result.push(0 - current)
  return result
}