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 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 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

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"6.9K\", \"totalAcceptedRaw\": 4137, \"totalSubmissionRaw\": 6949, \"acRate\": \"59.5%\"}",
"stats": "{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"7K\", \"totalAcceptedRaw\": 4144, \"totalSubmissionRaw\": 6959, \"acRate\": \"59.5%\"}",
"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)."