Given an integer n, return any array containing n unique integers such that they add up to 0.
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].
Input: n = 3 Output: [-1,0,1]
Input: n = 1 Output: [0]
1 <= n <= 1000
impl Solution {
pub fn sum_zero(n: i32) -> Vec<i32> {
((1 - n)..=n).step_by(2).collect()
}
}