// Package q1304 implements a solution for https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/
package q1304

func sumZero(n int) []int {
	ret := make([]int, n)
	for i := range n / 2 {
		ret[i*2] = i + 1
		ret[i*2+1] = -i - 1
	}
	return ret
}

var _ = sumZero