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/minimum-cost-to-cut-a-stick.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"13.2K\", \"totalAcceptedRaw\": 7544, \"totalSubmissionRaw\": 13203, \"acRate\": \"57.1%\"}",
"stats": "{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"13.2K\", \"totalAcceptedRaw\": 7545, \"totalSubmissionRaw\": 13204, \"acRate\": \"57.1%\"}",
"hints": [
"Build a dp array where dp[i][j] is the minimum cost to achieve all the cuts between i and j.",
"When you try to get the minimum cost between i and j, try all possible cuts k between them, dp[i][j] = min(dp[i][k] + dp[k][j]) + (j - i) for all possible cuts k between them."