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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/max-chunks-to-make-sorted.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1783,
"likes": 1786,
"dislikes": 180,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Max Chunks To Make Sorted II\", \"titleSlug\": \"max-chunks-to-make-sorted-ii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"69.3K\", \"totalSubmission\": \"120.3K\", \"totalAcceptedRaw\": 69266, \"totalSubmissionRaw\": 120313, \"acRate\": \"57.6%\"}",
"stats": "{\"totalAccepted\": \"69.4K\", \"totalSubmission\": \"120.5K\", \"totalAcceptedRaw\": 69387, \"totalSubmissionRaw\": 120514, \"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."
],