1
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

存量题库数据更新

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

View File

@@ -11,17 +11,30 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 3,
"likes": 4,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
"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"
}
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"248\", \"totalSubmission\": \"504\", \"totalAcceptedRaw\": 248, \"totalSubmissionRaw\": 504, \"acRate\": \"49.2%\"}",
"stats": "{\"totalAccepted\": \"327\", \"totalSubmission\": \"661\", \"totalAcceptedRaw\": 327, \"totalSubmissionRaw\": 661, \"acRate\": \"49.5%\"}",
"hints": [
"Try to solve the problem using combinatorics.",
"If the limit didnt exist, the problem would be distributing <code>n</code> candies between <code>3</code> children.",