mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 16:01:41 +08:00
update
This commit is contained in:
@@ -167,7 +167,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"56.2K\", \"totalSubmission\": \"94.9K\", \"totalAcceptedRaw\": 56185, \"totalSubmissionRaw\": 94932, \"acRate\": \"59.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"56.2K\", \"totalSubmission\": \"94.9K\", \"totalAcceptedRaw\": 56188, \"totalSubmissionRaw\": 94936, \"acRate\": \"59.2%\"}",
|
||||
"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