1304. Find N Unique Integers Sum up to Zero

标签：put   output   手机   uniq   ted   xpl   inpu   地铁   jpg   

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

地铁老爷爷看手机.jpg

class Solution {
    public int[] sumZero(int n) {
        int[] res = new int[n];
        int m = n;
        int ind = 0;
        if(n % 2 != 0){
            res[ind++] = 0;
        }

        for(;ind < n; ){
            res[ind++] = m;
            res[ind++] = -m;
            m--;
        }
        return res;
    }
}

1304. Find N Unique Integers Sum up to Zero

标签：put   output   手机   uniq   ted   xpl   inpu   地铁   jpg   

原文地址：https://www.cnblogs.com/wentiliangkaihua/p/12200851.html