Created
August 9, 2021 02:21
-
-
Save Rutvik17/edd71c0a344b1aa6a0887e56e64f553d to your computer and use it in GitHub Desktop.
Find N Unique Integers Sum Up To Zero
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
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 | |
*/ | |
/** | |
* @param {number} n | |
* @return {number[]} | |
*/ | |
var sumZero = function(n) { | |
const result = []; | |
let sum = 0; | |
for (let i = 1; i < n; i++){ | |
sum += i; | |
result.push(i); | |
} | |
result.push(-sum); | |
return result; | |
}; | |
console.log(sumZero(5)); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment