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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 1013,
"likes": 1015,
"dislikes": 452,
"isLiked": null,
"similarQuestions": "[]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"131.9K\", \"totalSubmission\": \"171.5K\", \"totalAcceptedRaw\": 131907, \"totalSubmissionRaw\": 171532, \"acRate\": \"76.9%\"}",
"stats": "{\"totalAccepted\": \"132.2K\", \"totalSubmission\": \"171.9K\", \"totalAcceptedRaw\": 132243, \"totalSubmissionRaw\": 171936, \"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."