coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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/max-chunks-to-make-sorted.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1786,
"dislikes": 180,
"likes": 1840,
"dislikes": 182,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Max Chunks To Make Sorted II\", \"titleSlug\": \"max-chunks-to-make-sorted-ii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[4,3,2,1,0]\n[1,0,2,3,4]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"69.4K\", \"totalSubmission\": \"120.5K\", \"totalAcceptedRaw\": 69387, \"totalSubmissionRaw\": 120514, \"acRate\": \"57.6%\"}",
"stats": "{\"totalAccepted\": \"70.7K\", \"totalSubmission\": \"122.7K\", \"totalAcceptedRaw\": 70740, \"totalSubmissionRaw\": 122724, \"acRate\": \"57.6%\"}",
"hints": [
"The first chunk can be found as the smallest k for which A[:k+1] == [0, 1, 2, ...k]; then we repeat this process."
],