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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 438,
"dislikes": 25,
"likes": 464,
"dislikes": 26,
"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}]",
"exampleTestcases": "[4,1,6,5]\n[2,10,3,2]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.6K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 13641, \"totalSubmissionRaw\": 33410, \"acRate\": \"40.8%\"}",
"stats": "{\"totalAccepted\": \"14.3K\", \"totalSubmission\": \"34.9K\", \"totalAcceptedRaw\": 14289, \"totalSubmissionRaw\": 34854, \"acRate\": \"41.0%\"}",
"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.",