class Solution {
public:
vector<int> sumZero(int n) {
if (n%2==1){
vector<int> res;
for(int i=n/2;i>=0;i--){
res.push_back(-i);
}
for(int i=1;i<=n/2;i++){
res.push_back(i);
}
return res;
}
else{
vector<int> res;
for(int i=n/2;i>=1;i--){
res.push_back(-i);
}
for(int i=1;i<=n/2;i++){
res.push_back(i);
}
return res;
}
}
};
1304. Find N Unique Integers Sum up to Zero
最新推荐文章于 2024-07-14 11:23:58 发布