coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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/partition-array-for-maximum-sum.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"32.2K\", \"totalSubmission\": \"42.7K\", \"totalAcceptedRaw\": 32213, \"totalSubmissionRaw\": 42746, \"acRate\": \"75.4%\"}",
"stats": "{\"totalAccepted\": \"32.2K\", \"totalSubmission\": \"42.7K\", \"totalAcceptedRaw\": 32216, \"totalSubmissionRaw\": 42749, \"acRate\": \"75.4%\"}",
"hints": [
"Think dynamic programming: dp[i] will be the answer for array A[0], ..., A[i-1].",
"For j = 1 .. k that keeps everything in bounds, dp[i] is the maximum of dp[i-j] + max(A[i-1], ..., A[i-j]) * j ."