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:
Example 2:
Example 3:
Constraints:
1 <= n <= 1000
解題
Runtime: 0 ms, faster than 100.00%
Memory Usage: 2.4 MB, less than 11.86%
Last updated