1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-25 06:48:57 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给你一个整数&nbsp;<code>n</code>,请你返回 <strong>任意&nbsp;</strong>一个由 <code>n</code>&nbsp;个 <strong>各不相同&nbsp;</strong>的整数组成的数组,并且这 <code>n</code> 个数相加和为 <code>0</code> 。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre><strong>输入:</strong>n = 5\n<strong>输出:</strong>[-7,-1,1,3,4]\n<strong>解释:</strong>这些数组也是正确的 [-5,-1,1,2,3][-3,-1,2,-2,4]。\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre><strong>输入:</strong>n = 3\n<strong>输出:</strong>[-1,0,1]\n</pre>\n\n<p><strong>示例 3</strong></p>\n\n<pre><strong>输入:</strong>n = 1\n<strong>输出:</strong>[0]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= n &lt;= 1000</code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 59,
"likes": 61,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"23.4K\", \"totalSubmission\": \"32.6K\", \"totalAcceptedRaw\": 23431, \"totalSubmissionRaw\": 32585, \"acRate\": \"71.9%\"}",
"stats": "{\"totalAccepted\": \"23.8K\", \"totalSubmission\": \"33.2K\", \"totalAcceptedRaw\": 23836, \"totalSubmissionRaw\": 33216, \"acRate\": \"71.8%\"}",
"hints": [
"Return an array where the values are symmetric. (+x , -x).",
"If n is odd, append value 0 in your returned array."