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/smallest-missing-non-negative-integer-after-operations.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.9K\", \"totalSubmission\": \"33.3K\", \"totalAcceptedRaw\": 12939, \"totalSubmissionRaw\": 33335, \"acRate\": \"38.8%\"}",
"stats": "{\"totalAccepted\": \"12.9K\", \"totalSubmission\": \"33.3K\", \"totalAcceptedRaw\": 12942, \"totalSubmissionRaw\": 33339, \"acRate\": \"38.8%\"}",
"hints": [
"Think about using modular arithmetic.",
"if x = nums[i] (mod value), then we can make nums[i] equal to x after some number of operations",