class Solution: | |||||
def sumZero(self, n): | |||||
# two cases: even and odd | |||||
result = [] | |||||
count = 1 | |||||
neg = True | |||||
# this ensure the odd case works | |||||
if n % 2 != 0: | |||||
result.append(0) | |||||
while len(result) != n: | |||||
if neg: | |||||
result.append(-count) | |||||
neg = False | |||||
else: | |||||
result.append(count) | |||||
count += 1 | |||||
neg = True | |||||
return result | |||||
s = Solution() | |||||
print("Expected: 0") | |||||
print("Got:", str(sum(s.sumZero(32)))) |
Given an integer n, return any array containing n unique integers such that they add up to 0. |
#!/bin/bash | |||||
python3 main.py |