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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -28,7 +28,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"2.4K\", \"totalAcceptedRaw\": 1746, \"totalSubmissionRaw\": 2378, \"acRate\": \"73.4%\"}",
"stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"2.4K\", \"totalAcceptedRaw\": 1749, \"totalSubmissionRaw\": 2382, \"acRate\": \"73.4%\"}",
"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.",