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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 963,
"dislikes": 792,
"likes": 968,
"dislikes": 800,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "1\n2\n3",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"54.7K\", \"totalSubmission\": \"116.5K\", \"totalAcceptedRaw\": 54720, \"totalSubmissionRaw\": 116509, \"acRate\": \"47.0%\"}",
"stats": "{\"totalAccepted\": \"55.2K\", \"totalSubmission\": \"117.4K\", \"totalAcceptedRaw\": 55195, \"totalSubmissionRaw\": 117370, \"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?"