leetcode1304. Find N Unique Integers Sum up to Zero
2022-03-02 13:52 作者:您是打尖兒還是住店呢 | 我要投稿
Given an integer?n, return?any?array containing?n?unique?integers such that they add up to?0.
?
Example 1:
Input: n = 5Output: [-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 = 3Output: [-1,0,1]
Example 3:
Input: n = 1Output: [0]
?
Constraints:
1 <= n <= 1000
這次有點(diǎn)快，有點(diǎn)不可思議，主要是看這個(gè)數(shù)據(jù)是奇數(shù)項(xiàng)還是偶數(shù)項(xiàng)；
Runtime:?0 ms, faster than?100.00%?of?Java?online submissions for?Find N Unique Integers Sum up to Zero.
Memory Usage:?42.8 MB, less than?6.64%?of?Java?online submissions for?Find N Unique Integers Sum up to Zero.
Next challenges:
標(biāo)簽：
