coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +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/originData/divide-array-in-sets-of-k-consecutive-numbers.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"78.5K\", \"totalSubmission\": \"138.7K\", \"totalAcceptedRaw\": 78545, \"totalSubmissionRaw\": 138747, \"acRate\": \"56.6%\"}",
"stats": "{\"totalAccepted\": \"78.5K\", \"totalSubmission\": \"138.7K\", \"totalAcceptedRaw\": 78546, \"totalSubmissionRaw\": 138749, \"acRate\": \"56.6%\"}",
"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.",