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-difficulty-of-a-job-schedule.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 18618, \"totalSubmissionRaw\": 27938, \"acRate\": \"66.6%\"}",
"stats": "{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 18624, \"totalSubmissionRaw\": 27948, \"acRate\": \"66.6%\"}",
"hints": [
"Use DP. Try to cut the array into d non-empty sub-arrays. Try all possible cuts for the array.",
"Use dp[i][j] where DP states are i the index of the last cut and j the number of remaining cuts. Complexity is O(n * n * d)."