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

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/[no content]count-ways-to-distribute-candies.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 41,
"dislikes": 5,
"likes": 45,
"dislikes": 6,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "3\n2\n4\n2\n20\n5",
@@ -28,7 +28,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1399, \"totalSubmissionRaw\": 2321, \"acRate\": \"60.3%\"}",
"stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"2.4K\", \"totalAcceptedRaw\": 1473, \"totalSubmissionRaw\": 2423, \"acRate\": \"60.8%\"}",
"hints": [
"Try to define a recursive approach. For the ith candies, there will be one of the two following cases:",
"If the i - 1 previous candies are already distributed into k bags for the ith candy, you can have k * dp[n - 1][k] ways to distribute the ith candy. We need then to solve the state of (n - 1, k).",