mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 08:21:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"27K\", \"totalSubmission\": \"48.7K\", \"totalAcceptedRaw\": 26963, \"totalSubmissionRaw\": 48699, \"acRate\": \"55.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"27K\", \"totalSubmission\": \"48.7K\", \"totalAcceptedRaw\": 26964, \"totalSubmissionRaw\": 48700, \"acRate\": \"55.4%\"}",
|
||||
"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