coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/originData/maximum-number-of-groups-getting-fresh-donuts.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"15.2K\", \"totalAcceptedRaw\": 6085, \"totalSubmissionRaw\": 15215, \"acRate\": \"40.0%\"}",
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"15.2K\", \"totalAcceptedRaw\": 6085, \"totalSubmissionRaw\": 15216, \"acRate\": \"40.0%\"}",
"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?",