coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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

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

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 75,
"likes": 79,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"8K\", \"totalAcceptedRaw\": 4526, \"totalSubmissionRaw\": 7960, \"acRate\": \"56.9%\"}",
"stats": "{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"8.5K\", \"totalAcceptedRaw\": 4874, \"totalSubmissionRaw\": 8523, \"acRate\": \"57.2%\"}",
"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.",