mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,19 +11,31 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 266,
|
||||
"dislikes": 5,
|
||||
"likes": 403,
|
||||
"dislikes": 6,
|
||||
"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",
|
||||
"categoryTitle": "Algorithms",
|
||||
"contributors": [],
|
||||
"topicTags": [
|
||||
{
|
||||
"name": "Array",
|
||||
"slug": "array",
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
},
|
||||
{
|
||||
"name": "Dynamic Programming",
|
||||
"slug": "dynamic-programming",
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
},
|
||||
{
|
||||
"name": "Prefix Sum",
|
||||
"slug": "prefix-sum",
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
}
|
||||
],
|
||||
"companyTagStats": null,
|
||||
@@ -137,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"11.3K\", \"totalAcceptedRaw\": 5219, \"totalSubmissionRaw\": 11310, \"acRate\": \"46.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"8K\", \"totalSubmission\": \"16.4K\", \"totalAcceptedRaw\": 8012, \"totalSubmissionRaw\": 16419, \"acRate\": \"48.8%\"}",
|
||||
"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?"
|
||||
|
Reference in New Issue
Block a user