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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
leetcode/originData/distribute-candies-among-children-ii.json
View File

@@ -11,14 +11,33 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 33,
"dislikes": 69,
"likes": 68,
"dislikes": 98,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Count Ways to Distribute Candies\", \"titleSlug\": \"count-ways-to-distribute-candies\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "5\n2\n3\n3",
"categoryTitle": "Algorithms",
"contributors": [],
"topicTags": [],
"topicTags": [
{
"name": "Math",
"slug": "math",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Combinatorics",
"slug": "combinatorics",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Enumeration",
"slug": "enumeration",
"translatedName": null,
"__typename": "TopicTagNode"
}
],
"companyTagStats": null,
"codeSnippets": [
{
@@ -136,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"23.6K\", \"totalAcceptedRaw\": 7355, \"totalSubmissionRaw\": 23602, \"acRate\": \"31.2%\"}",
"stats": "{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"29.2K\", \"totalAcceptedRaw\": 9871, \"totalSubmissionRaw\": 29152, \"acRate\": \"33.9%\"}",
"hints": [
"We can enumerate the number of candies of one particular child, let it be <code>i</code> which means <code>0 <= i <= min(limit, n)</code>.",
"Suppose the 2nd child gets <code>j</code> candies. Then <code>0 <= j <= limit</code> and <code>i + j <= n</code>.",