LeetCode in Kotlin
1304. Find N Unique Integers Sum up to Zero
Easy
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 {
fun sumZero(n: Int): IntArray {
val result = IntArray(n)
var start = -n / 2
for (i in 0 until n / 2) {
result[i] = start++
}
if (n % 2 == 0) {
start++
}
for (i in n / 2 until n) {
result[i] = start++
}
return result
}
}