coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/maximum-number-of-groups-getting-fresh-donuts.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 219,
"dislikes": 14,
"likes": 225,
"dislikes": 15,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "3\n[1,2,3,4,5,6]\n4\n[1,3,2,5,2,2,1,6]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"10.3K\", \"totalAcceptedRaw\": 4127, \"totalSubmissionRaw\": 10315, \"acRate\": \"40.0%\"}",
"stats": "{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"10.5K\", \"totalAcceptedRaw\": 4203, \"totalSubmissionRaw\": 10529, \"acRate\": \"39.9%\"}",
"hints": [
"The maximum number of happy groups is the maximum number of partitions you can split the groups into such that the sum of group sizes in each partition is 0 mod batchSize. At most one partition is allowed to have a different remainder (the first group will get fresh donuts anyway).",
"Suppose you have an array freq of length k where freq[i] = number of groups of size i mod batchSize. How can you utilize this in a dp solution?",