coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-23 05:48:57 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -28,7 +28,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"336\", \"totalSubmission\": \"522\", \"totalAcceptedRaw\": 336, \"totalSubmissionRaw\": 522, \"acRate\": \"64.4%\"}",
"stats": "{\"totalAccepted\": \"346\", \"totalSubmission\": \"535\", \"totalAcceptedRaw\": 346, \"totalSubmissionRaw\": 535, \"acRate\": \"64.7%\"}",
"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).",