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

4
leetcode/originData/removing-minimum-number-of-magic-beans.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 826,
"likes": 827,
"dislikes": 46,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Moves to Equal Array Elements II\", \"titleSlug\": \"minimum-moves-to-equal-array-elements-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Operations to Reduce X to Zero\", \"titleSlug\": \"minimum-operations-to-reduce-x-to-zero\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.4K\", \"totalSubmission\": \"57.5K\", \"totalAcceptedRaw\": 24371, \"totalSubmissionRaw\": 57472, \"acRate\": \"42.4%\"}",
"stats": "{\"totalAccepted\": \"24.4K\", \"totalSubmission\": \"57.5K\", \"totalAcceptedRaw\": 24372, \"totalSubmissionRaw\": 57476, \"acRate\": \"42.4%\"}",
"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.",