Leetcode 1304. Find N Unique Integers Sum up to Zero

Posted 2021-09-13 SnailTyan

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

**解析：**Version 1，为了实现和为0，因此添加元素时成对添加+i, -i，如果n为奇数，再加上0即可。

• Version 1

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

Reference

1. https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/