mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-22 21:46:46 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"15.6K\", \"totalAcceptedRaw\": 7358, \"totalSubmissionRaw\": 15582, \"acRate\": \"47.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"15.8K\", \"totalAcceptedRaw\": 7459, \"totalSubmissionRaw\": 15789, \"acRate\": \"47.2%\"}",
|
||||
"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