mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 14:12:17 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"6.7K\", \"totalSubmission\": \"17.1K\", \"totalAcceptedRaw\": 6723, \"totalSubmissionRaw\": 17145, \"acRate\": \"39.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"6.7K\", \"totalSubmission\": \"17.2K\", \"totalAcceptedRaw\": 6742, \"totalSubmissionRaw\": 17202, \"acRate\": \"39.2%\"}",
|
||||
"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.",
|
||||
|
Reference in New Issue
Block a user