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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"13.1K\", \"totalAcceptedRaw\": 7814, \"totalSubmissionRaw\": 13136, \"acRate\": \"59.5%\"}",
"stats": "{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"13.1K\", \"totalAcceptedRaw\": 7816, \"totalSubmissionRaw\": 13138, \"acRate\": \"59.5%\"}",
"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.",