mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 16:01:41 +08:00
update
This commit is contained in:
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"26.9K\", \"totalAcceptedRaw\": 13270, \"totalSubmissionRaw\": 26867, \"acRate\": \"49.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"26.9K\", \"totalAcceptedRaw\": 13274, \"totalSubmissionRaw\": 26872, \"acRate\": \"49.4%\"}",
|
||||
"hints": [
|
||||
"If the smallest number in the possible-to-split array is V, then numbers V+1, V+2, ... V+k-1 must contain there as well.",
|
||||
"You can iteratively find k sets and remove them from array until it becomes empty.",
|
||||
|
Reference in New Issue
Block a user