mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 14:12:17 +08:00
update
This commit is contained in:
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"15.8K\", \"totalSubmission\": \"27.2K\", \"totalAcceptedRaw\": 15835, \"totalSubmissionRaw\": 27152, \"acRate\": \"58.3%\"}",
|
||||
"stats": "{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"27.2K\", \"totalAcceptedRaw\": 15872, \"totalSubmissionRaw\": 27208, \"acRate\": \"58.3%\"}",
|
||||
"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."
|
||||
],
|
||||
|
Reference in New Issue
Block a user