Find N Unique Integers Sum up to Zero Solutions in GoNumber 1304Difficulty EasyAcceptance 76.3%Link LeetCodeOther languages C++SolutionsGo solution by halfrost/LeetCode-Gopackage leetcode 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}package leetcode 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 }