Today I have done leetcode's September LeetCoding Challenge with cpp.

September LeetCoding Challenge 7

Description

Find N Unique Integers Sum up to Zero

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

Solution

class Solution {
public:
  vector<int> sumZero(int n) {
    vector<int> answer(n);
    for(int i = 0; i * 2 + 1 < n; ++i) {
      answer[i * 2] = i + 1;
      answer[i * 2 + 1] = -i - 1;
    }
    return move(answer);
  }
};

// Accepted
// 42/42 cases passed (0 ms)
// Your runtime beats 100 % of cpp submissions
// Your memory usage beats 83.89 % of cpp submissions (9.6 MB)