1304. Find N Unique Integers Sum up to Zero #

Problem #

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

Problem Summary #

Given an integer n, return any array consisting of n distinct integers, and the sum of these n numbers is 0.

Note:

• 1 <= n <= 1000

Solution Ideas #

• Given a number n, output an array with n numbers, where the sum of the elements is 0.
• Easy problem; a simple loop is enough.

Code #

func sumZero(n int) []int {
	res, left, right, start := make([]int, n), 0, n-1, 1
	for left < right {
		res[left] = start
		res[right] = -start
		start++
		left = left + 1
		right = right - 1
	}
	return res
}