1304. Find N Unique Integers Sum up to Zero

JIAKAOBO

LeetCode

感谢赞助!

• ㊗️
• 大家
• offer
• 多多！

Problem

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]

Code

class Solution {
    public int[] sumZero(int n) {
        int[] res = new int[n];
        int index = 0;
        int num = n / 2;

        while(num != 0) {
            res[index] = -num;
            res[n - index - 1] = num;
            index++;
            num--;
        }

        return res;
    }
}