mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
update
This commit is contained in:
@@ -46,7 +46,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"184.6K\", \"totalSubmission\": \"235.6K\", \"totalAcceptedRaw\": 184614, \"totalSubmissionRaw\": 235647, \"acRate\": \"78.3%\"}",
|
||||
"stats": "{\"totalAccepted\": \"184.6K\", \"totalSubmission\": \"235.7K\", \"totalAcceptedRaw\": 184649, \"totalSubmissionRaw\": 235687, \"acRate\": \"78.3%\"}",
|
||||
"hints": [
|
||||
"Store the path from p to the root.",
|
||||
"Traverse the path from q to the root, the first common point of the two paths is the LCA."
|
||||
|
Reference in New Issue
Block a user