mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -167,7 +167,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"98.7K\", \"totalSubmission\": \"169.4K\", \"totalAcceptedRaw\": 98676, \"totalSubmissionRaw\": 169419, \"acRate\": \"58.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"98.7K\", \"totalSubmission\": \"169.4K\", \"totalAcceptedRaw\": 98686, \"totalSubmissionRaw\": 169441, \"acRate\": \"58.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