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

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/originData/minimum-cost-tree-from-leaf-values.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"93K\", \"totalSubmission\": \"136.9K\", \"totalAcceptedRaw\": 92962, \"totalSubmissionRaw\": 136885, \"acRate\": \"67.9%\"}",
"stats": "{\"totalAccepted\": \"93K\", \"totalSubmission\": \"136.9K\", \"totalAcceptedRaw\": 92968, \"totalSubmissionRaw\": 136900, \"acRate\": \"67.9%\"}",
"hints": [
"Do a DP, where dp(i, j) is the answer for the subarray arr[i]..arr[j].",
"For each possible way to partition the subarray i <= k < j, the answer is max(arr[i]..arr[k]) * max(arr[k+1]..arr[j]) + dp(i, k) + dp(k+1, j)."