# 1304.Find-N-Unique-Integers-Sum-up-to-Zero

## 1304. Find N Unique Integers Sum up to Zero

## 题目地址

<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
```

## 代码

### Approach #1

`A[i] = i * 2 - n + 1`

```java
class Solution {
  public int[] sumZero(int n) {
        int[] A = new int[n];
    for (int i = 0; i < n; i++) {
      A[i] = i * 2 - n + 1;
    }

    return A;
  }
}
```

### Approach #2 Two Points

```java
public int[] sumZero(int n) {
    int[] res = new int[n];
    int left = 0, right = n - 1, start = 1;
    while (left < right) { // in the middle is zero
        res[left++] = start;
        res[right--] = -start;
        start++;
    }
    return res;
  }
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://wentao-shao.gitbook.io/leetcode/array/1304.find-n-unique-integers-sum-up-to-zero.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.