mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-08 08:51:42 +08:00
update
This commit is contained in:
@@ -34,7 +34,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"50K\", \"totalSubmission\": \"86K\", \"totalAcceptedRaw\": 50005, \"totalSubmissionRaw\": 86014, \"acRate\": \"58.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"50K\", \"totalSubmission\": \"86K\", \"totalAcceptedRaw\": 50005, \"totalSubmissionRaw\": 86015, \"acRate\": \"58.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.",
|
||||
|
Reference in New Issue
Block a user