Find N Unique Integers Sum up to Zero LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<int> sumZero(int n) {
4
    vector<int> ans;
5
    for (int i = 1; i <= n / 2; i++) {
6
      ans.push_back(-i);
7
      ans.push_back(i);
8
    }
9
    if (n % 2 == 1) ans.push_back(0);
10
    return ans;
11
  }
12
};