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

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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"12.9K\", \"totalAcceptedRaw\": 7238, \"totalSubmissionRaw\": 12921, \"acRate\": \"56.0%\"}",
"stats": "{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"12.9K\", \"totalAcceptedRaw\": 7243, \"totalSubmissionRaw\": 12927, \"acRate\": \"56.0%\"}",
"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?"