coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-03 06:22:54 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2K\", \"totalSubmission\": \"6.5K\", \"totalAcceptedRaw\": 1960, \"totalSubmissionRaw\": 6524, \"acRate\": \"30.0%\"}",
"stats": "{\"totalAccepted\": \"2K\", \"totalSubmission\": \"6.5K\", \"totalAcceptedRaw\": 1962, \"totalSubmissionRaw\": 6526, \"acRate\": \"30.1%\"}",
"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?",