coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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-cn/originData/smallest-integer-divisible-by-k.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"26.3K\", \"totalSubmission\": \"56.5K\", \"totalAcceptedRaw\": 26322, \"totalSubmissionRaw\": 56450, \"acRate\": \"46.6%\"}",
"stats": "{\"totalAccepted\": \"26.3K\", \"totalSubmission\": \"56.5K\", \"totalAcceptedRaw\": 26324, \"totalSubmissionRaw\": 56453, \"acRate\": \"46.6%\"}",
"hints": [
"11111 = 1111 * 10 + 1\r\nWe only need to store remainders modulo K.",
"If we never get a remainder of 0, why would that happen, and how would we know that?"