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:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/minimum-cost-tree-from-leaf-values.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 2981,
"dislikes": 211,
"likes": 2983,
"dislikes": 212,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[6,2,4]\n[4,11]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"69.7K\", \"totalSubmission\": \"101.9K\", \"totalAcceptedRaw\": 69742, \"totalSubmissionRaw\": 101911, \"acRate\": \"68.4%\"}",
"stats": "{\"totalAccepted\": \"69.8K\", \"totalSubmission\": \"102K\", \"totalAcceptedRaw\": 69823, \"totalSubmissionRaw\": 102016, \"acRate\": \"68.4%\"}",
"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)."