coder-xiaomo/leetcode-problemset
1
0
Fork 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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/maximum-value-of-k-coins-from-piles.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 130,
"dislikes": 2,
"likes": 266,
"dislikes": 5,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Coin Change\", \"titleSlug\": \"coin-change\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Coin Change 2\", \"titleSlug\": \"coin-change-2\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[[1,100,3],[7,8,9]]\n2\n[[100],[100],[100],[100],[100],[100],[1,1,1,1,1,1,700]]\n7",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"6.8K\", \"totalAcceptedRaw\": 2725, \"totalSubmissionRaw\": 6785, \"acRate\": \"40.2%\"}",
"stats": "{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"11.3K\", \"totalAcceptedRaw\": 5219, \"totalSubmissionRaw\": 11310, \"acRate\": \"46.1%\"}",
"hints": [
"For each pile i, what will be the total value of coins we can collect if we choose the first j coins?",
"How can we use dynamic programming to combine the results from different piles to find the most optimal answer?"