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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/[no content]divide-chocolate.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 695,
"likes": 697,
"dislikes": 46,
"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}]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"35.4K\", \"totalSubmission\": \"63.2K\", \"totalAcceptedRaw\": 35418, \"totalSubmissionRaw\": 63182, \"acRate\": \"56.1%\"}",
"stats": "{\"totalAccepted\": \"35.5K\", \"totalSubmission\": \"63.3K\", \"totalAcceptedRaw\": 35484, \"totalSubmissionRaw\": 63294, \"acRate\": \"56.1%\"}",
"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.",