find-n-unique-integers-sum-up-to-zero.cpp

// Time:  O(n)
// Space: O(1)

class Solution {
public:
    vector<int> sumZero(int n) {
        vector<int> result;
        for (int i = -(n / 2); i <= (n / 2); ++i) {
            if (i == 0 && n % 2 == 0) {
                continue;
            }
            result.emplace_back(i);
        }
        return result;
    }
};