LeetCode 1304. Find N Unique Integers Sum up to Zero

Description

https://leetcode.com/problems/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

Explanation

Depends on whether N is even or odd number, increase the result list.

Python Solution

class Solution:
    def sumZero(self, n: int) -> List[int]:
        results = []
        
        if n % 2 == 0:
            while n > 0:
                results.append(n // 2)
                results.append(-n // 2)
                n -= 2
        else:            
            results.append(0)
            n -= 1
            
            while n > 0:
                results.append(n // 2)
                results.append(-n // 2)
                n -= 2
          
        
        return results
  • Time Complexity: O(N)
  • Space Complexity: O(N)

Leave a Reply

Your email address will not be published.