coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 13:36:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 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

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 5602, \"totalSubmissionRaw\": 15457, \"acRate\": \"36.2%\"}",
"stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 5612, \"totalSubmissionRaw\": 15481, \"acRate\": \"36.3%\"}",
"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?"