Find N Unique Integers Sum up to Zero — LeetCode 1304 Python Solution

The problem

Given an integer n, return any array containing n unique integers such that they add up to 0.

Example

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].

Python solution

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

Complexity

Pattern: Math and Number Theory

Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 1304. Find N Unique Integers Sum up to Zero is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math.

The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.

Related problems