Saved from https://leetcode-cn.com/problems/find-n-unique-integers-sum-up-to-zero/submissions/
func sumZero(n int) []int { if n <= 0 { return []int{} } res := make([]int, n) for i := 0; i < n - 1; i++ { res[i] = i } res[n-1] = - ((n - 2) * (n - 1) >> 1) return res }