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/duplicate-zeros.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 1597,
"dislikes": 509,
"likes": 1634,
"dislikes": 526,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,0,2,3,0,4,5,0]\n[1,2,3]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"255.6K\", \"totalSubmission\": \"499.9K\", \"totalAcceptedRaw\": 255597, \"totalSubmissionRaw\": 499924, \"acRate\": \"51.1%\"}",
"stats": "{\"totalAccepted\": \"262.7K\", \"totalSubmission\": \"513.9K\", \"totalAcceptedRaw\": 262728, \"totalSubmissionRaw\": 513949, \"acRate\": \"51.1%\"}",
"hints": [
"This is a great introductory problem for understanding and working with the concept of in-place operations. The problem statement clearly states that we are to modify the array in-place. That does not mean we cannot use another array. We just don't have to return anything.",
"A better way to solve this would be without using additional space. The only reason the problem statement allows you to make modifications in place is that it hints at avoiding any additional memory.",