coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/minimum-difficulty-of-a-job-schedule.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1192,
"dislikes": 138,
"likes": 1225,
"dislikes": 142,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[6,5,4,3,2,1]\n2\n[9,9,9]\n4\n[1,1,1]\n3",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"66.3K\", \"totalSubmission\": \"117K\", \"totalAcceptedRaw\": 66278, \"totalSubmissionRaw\": 117022, \"acRate\": \"56.6%\"}",
"stats": "{\"totalAccepted\": \"68.2K\", \"totalSubmission\": \"120.7K\", \"totalAcceptedRaw\": 68223, \"totalSubmissionRaw\": 120710, \"acRate\": \"56.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)."