coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-10 01:41:41 +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

17
leetcode-cn/originData/[no content]distribute-candies-among-children-iii.json
View File

@@ -18,10 +18,23 @@
"similarQuestions": "[]",
"contributors": [],
"langToValidPlayground": null,
"topicTags": [],
"topicTags": [
{
"name": "Math",
"slug": "math",
"translatedName": "数学",
"__typename": "TopicTagNode"
},
{
"name": "Combinatorics",
"slug": "combinatorics",
"translatedName": "组合数学",
"__typename": "TopicTagNode"
}
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"37\", \"totalSubmission\": \"64\", \"totalAcceptedRaw\": 37, \"totalSubmissionRaw\": 64, \"acRate\": \"57.8%\"}",
"stats": "{\"totalAccepted\": \"58\", \"totalSubmission\": \"89\", \"totalAcceptedRaw\": 58, \"totalSubmissionRaw\": 89, \"acRate\": \"65.2%\"}",
"hints": [
"Try to solve the problem using combinatorics.",
"If the limit didn’t exist, the problem would be distributing <code>n</code> candies between <code>3</code> children.",