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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/smallest-integer-divisible-by-k.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"54.7K\", \"totalSubmission\": \"116.4K\", \"totalAcceptedRaw\": 54692, \"totalSubmissionRaw\": 116446, \"acRate\": \"47.0%\"}",
"stats": "{\"totalAccepted\": \"54.7K\", \"totalSubmission\": \"116.5K\", \"totalAcceptedRaw\": 54720, \"totalSubmissionRaw\": 116509, \"acRate\": \"47.0%\"}",
"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?"