coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 05:26:46 +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

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

@@ -28,7 +28,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"115\", \"totalSubmission\": \"170\", \"totalAcceptedRaw\": 115, \"totalSubmissionRaw\": 170, \"acRate\": \"67.6%\"}",
"stats": "{\"totalAccepted\": \"127\", \"totalSubmission\": \"182\", \"totalAcceptedRaw\": 127, \"totalSubmissionRaw\": 182, \"acRate\": \"69.8%\"}",
"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.",