coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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

6
leetcode/originData/divide-array-in-sets-of-k-consecutive-numbers.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1049,
"dislikes": 80,
"likes": 1072,
"dislikes": 82,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Split Array into Consecutive Subsequences\", \"titleSlug\": \"split-array-into-consecutive-subsequences\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"All Divisions With the Highest Score of a Binary Array\", \"titleSlug\": \"all-divisions-with-the-highest-score-of-a-binary-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,3,3,4,4,5,6]\n4\n[3,2,1,2,3,4,3,4,5,9,10,11]\n3\n[1,2,3,4]\n3",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"58.1K\", \"totalSubmission\": \"102.9K\", \"totalAcceptedRaw\": 58107, \"totalSubmissionRaw\": 102866, \"acRate\": \"56.5%\"}",
"stats": "{\"totalAccepted\": \"59.1K\", \"totalSubmission\": \"104.6K\", \"totalAcceptedRaw\": 59123, \"totalSubmissionRaw\": 104639, \"acRate\": \"56.5%\"}",
"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.",