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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/minimum-number-of-coins-for-fruits.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 126,
"likes": 128,
"dislikes": 26,
"isLiked": null,
"similarQuestions": "[]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"22.6K\", \"totalAcceptedRaw\": 9522, \"totalSubmissionRaw\": 22589, \"acRate\": \"42.2%\"}",
"stats": "{\"totalAccepted\": \"9.6K\", \"totalSubmission\": \"22.7K\", \"totalAcceptedRaw\": 9583, \"totalSubmissionRaw\": 22733, \"acRate\": \"42.2%\"}",
"hints": [
"The intended solution uses Dynamic Programming.",
"Let <code>dp[i]</code> denote the minimum number of coins, such that we bought <code>i<sup>th</sup></code> fruit and acquired all the fruits in the range <code>[i...n]</code>.",