【leetcode】1304. Find N Unique Integers Sum up to Zero

题目如下：

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

解题思路：很简单，如果n是偶数，例如6，那么就是[-3,-2,-1,1,2,3]，如果是奇数，比如7，那么在[-3,-2,-1,1,2,3]的基础上加一个0即可。

代码如下：

class Solution(object):
    def sumZero(self, n):
        """
        :type n: int
        :rtype: List[int]
        """
        res = []
        if n % 2 == 1:
            res.append(0)
        count = n/2
        while count > 0:
            res.append(count)
            res.append(-count)
            count -= 1
        return res