LeetCode 1304 Find N Unique Integers Sum up to Zero

LeetCode

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，求n个数的数组使得数组和为0

解题思路：

Easy题，只要将相反数放入数组即可

解题步骤：

N/A

注意事项：

1. Python代码：

   def sumZero(self, n: int) -> List[int]:
   	res = []
   	if n % 2 == 1:
   		res.append(0)
   	for i in range(n // 2):
   		res.append(i + 1)
   		res.append(-i - 1)
   	return res

算法分析：

时间复杂度为O(n)，空间复杂度O(1)