0
点赞
收藏
分享

微信扫一扫

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

兵部尚输 2022-08-10 阅读 22


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​

​题解:​

class Solution {
public:
vector<int> sumZero(int n) {
int sum = 0;
vector<int> res;
if (n == 0) {
return {0};
}
for (int i = 1; i < n; i++) {
sum += i;
res.push_back(i);
}
res.push_back(-sum);
return res;
}
};

 

举报

相关推荐

0 条评论