1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 158,
"dislikes": 13,
"likes": 331,
"dislikes": 20,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Koko Eating Bananas\", \"titleSlug\": \"koko-eating-bananas\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Limit of Balls in a Bag\", \"titleSlug\": \"minimum-limit-of-balls-in-a-bag\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Speed to Arrive on Time\", \"titleSlug\": \"minimum-speed-to-arrive-on-time\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Number of Removable Characters\", \"titleSlug\": \"maximum-number-of-removable-characters\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimized Maximum of Products Distributed to Any Store\", \"titleSlug\": \"minimized-maximum-of-products-distributed-to-any-store\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Time to Complete Trips\", \"titleSlug\": \"minimum-time-to-complete-trips\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[5,8,6]\n3\n[2,5]\n11",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"24.7K\", \"totalAcceptedRaw\": 7836, \"totalSubmissionRaw\": 24736, \"acRate\": \"31.7%\"}",
"stats": "{\"totalAccepted\": \"14.3K\", \"totalSubmission\": \"41.2K\", \"totalAcceptedRaw\": 14282, \"totalSubmissionRaw\": 41175, \"acRate\": \"34.7%\"}",
"hints": [
"For a fixed number of candies c, how can you check if each child can get c candies?",
"Use binary search to find the maximum c as the answer."