coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 16:01: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

4
leetcode/originData/[no content]elements-in-array-after-removing-and-replacing-elements.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 35,
"likes": 36,
"dislikes": 5,
"isLiked": null,
"similarQuestions": "[]",
@@ -28,7 +28,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"853\", \"totalSubmission\": \"1.2K\", \"totalAcceptedRaw\": 853, \"totalSubmissionRaw\": 1158, \"acRate\": \"73.7%\"}",
"stats": "{\"totalAccepted\": \"910\", \"totalSubmission\": \"1.2K\", \"totalAcceptedRaw\": 910, \"totalSubmissionRaw\": 1232, \"acRate\": \"73.9%\"}",
"hints": [
"Try to find a pattern in how nums changes.",
"Let m be the original length of nums. If time_i / m (integer division) is even, then nums is at its original size or decreasing in size. If it is odd, then it is empty, or increasing in size.",