coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/find-n-unique-integers-sum-up-to-zero.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 1015,
"dislikes": 452,
"likes": 1054,
"dislikes": 457,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "5\n3\n1",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"132.2K\", \"totalSubmission\": \"171.9K\", \"totalAcceptedRaw\": 132243, \"totalSubmissionRaw\": 171936, \"acRate\": \"76.9%\"}",
"stats": "{\"totalAccepted\": \"136.4K\", \"totalSubmission\": \"177.3K\", \"totalAcceptedRaw\": 136437, \"totalSubmissionRaw\": 177321, \"acRate\": \"76.9%\"}",
"hints": [
"Return an array where the values are symmetric. (+x , -x).",
"If n is odd, append value 0 in your returned array."