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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"5.2K\", \"totalAcceptedRaw\": 3087, \"totalSubmissionRaw\": 5221, \"acRate\": \"59.1%\"}",
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"5.2K\", \"totalAcceptedRaw\": 3095, \"totalSubmissionRaw\": 5237, \"acRate\": \"59.1%\"}",
"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>.",