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`


from heapq import heappush, heappop


def longestHappyString(a, b, c):
    res = ""
    pq = []
    if a:
        heappush(pq, (-a, 'a'))
    if b:
        heappush(pq, (-b, 'b'))
    if c:
        heappush(pq, (-c, 'c'))

    while pq:
        curr = heappop(pq)
        if len(res) >= 2 and res[-1] == curr[1] and res[-2] == curr[1]:
            if not pq:
                break
            next = heappop(pq)
            res += next[1]
            if next[0] < -1:
                heappush(pq, (next[0] + 1, next[1]))
            heappush(pq, curr)
        else:
            res += curr[1]
            if curr[0] < -1:
                heappush(pq, (curr[0] + 1, curr[1]))

    return res
