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/removing-minimum-number-of-magic-beans.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"24.1K\", \"totalAcceptedRaw\": 9810, \"totalSubmissionRaw\": 24080, \"acRate\": \"40.7%\"}",
"stats": "{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"24.1K\", \"totalAcceptedRaw\": 9813, \"totalSubmissionRaw\": 24091, \"acRate\": \"40.7%\"}",
"hints": [
"Notice that if we choose to make x bags of beans empty, we should choose the x bags with the least amount of beans.",
"Notice that if the minimum number of beans in a non-empty bag is m, then the best way to make all bags have an equal amount of beans is to reduce all the bags to have m beans.",