coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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/[no content]divide-chocolate.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 697,
"dislikes": 46,
"likes": 721,
"dislikes": 48,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Split Array Largest Sum\", \"titleSlug\": \"split-array-largest-sum\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Capacity To Ship Packages Within D Days\", \"titleSlug\": \"capacity-to-ship-packages-within-d-days\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,3,4,5,6,7,8,9]\n5\n[5,6,7,8,9,1,2,3,4]\n8\n[1,2,2,1,2,2,1,2,2]\n2",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"35.5K\", \"totalSubmission\": \"63.3K\", \"totalAcceptedRaw\": 35484, \"totalSubmissionRaw\": 63294, \"acRate\": \"56.1%\"}",
"stats": "{\"totalAccepted\": \"36.5K\", \"totalSubmission\": \"64.9K\", \"totalAcceptedRaw\": 36513, \"totalSubmissionRaw\": 64907, \"acRate\": \"56.3%\"}",
"hints": [
"After dividing the array into K+1 sub-arrays, you will pick the sub-array with the minimum sum.",
"Divide the sub-array into K+1 sub-arrays such that the minimum sub-array sum is as maximum as possible.",