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-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

4
leetcode/originData/maximum-number-of-balls-in-a-box.json
View File

@@ -12,7 +12,7 @@
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 354,
"dislikes": 82,
"dislikes": 83,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "1\n10\n5\n15\n19\n28",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"50.5K\", \"totalAcceptedRaw\": 37240, \"totalSubmissionRaw\": 50544, \"acRate\": \"73.7%\"}",
"stats": "{\"totalAccepted\": \"37.3K\", \"totalSubmission\": \"50.6K\", \"totalAcceptedRaw\": 37285, \"totalSubmissionRaw\": 50609, \"acRate\": \"73.7%\"}",
"hints": [
"Note that both lowLimit and highLimit are of small constraints so you can iterate on all nubmer between them",
"You can simulate the boxes by counting for each box the number of balls with digit sum equal to that box number"