Leetcode - Find N Unique Integers Sum up to Zero Solution — The Poor Coder

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

Example 1:

Text

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:

Text

Input: n = 3
Output: [-1,0,1]

Example 3:

Text

Input: n = 1
Output: [0]

Constraints:

1 <= n <= 1000

Solution in Python#

Python

class Solution:
    def sumZero(self, n: int) -> List[int]:
        positive = list(range(n+1,n+1+n//2))
        negative = list(map(lambda x:x*-1,positive))
        if n%2:
            return positive+negative+[0]
        else:
            return positive+negative

May 112021

Leetcode - Find the Highest Altitude Solution

There is a biker going on a road trip. The road trip consists of n + 1 points at different altitudes. The biker starts his trip on point 0 with altitude equal 0. You are given an integer array gain of length n where…

leetcode array1 min read

May 112021

Leetcode - Count Good Meals Solution

A good meal is a meal that contains exactly two different food items with a sum of deliciousness equal to a power of two. You can pick any two different foods to make a good meal. Given an array of integers…

leetcode array Hash Table2 min read

May 112021

Leetcode - Average Waiting Time Solution

There is a restaurant with a single chef. You are given an array customers, where customers[i] = [arrivali, timei]: arrivali is the arrival time of the ith customer. The arrival times are sorted in non-decreasing order…

leetcode array4 min read

Solution in Python#

Related posts

Leetcode - Find the Highest Altitude Solution

Leetcode - Count Good Meals Solution

Leetcode - Average Waiting Time Solution