mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"43.7K\", \"totalSubmission\": \"84.2K\", \"totalAcceptedRaw\": 43668, \"totalSubmissionRaw\": 84248, \"acRate\": \"51.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"43.7K\", \"totalSubmission\": \"84.2K\", \"totalAcceptedRaw\": 43670, \"totalSubmissionRaw\": 84250, \"acRate\": \"51.8%\"}",
|
||||
"hints": [
|
||||
"The best move y must be immediately adjacent to x, since it locks out that subtree.",
|
||||
"Can you count each of (up to) 3 different subtrees neighboring x?"
|
||||
|
Reference in New Issue
Block a user