mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-21 21:16:45 +08:00
update
This commit is contained in:
@@ -40,7 +40,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"3.1K\", \"totalAcceptedRaw\": 2487, \"totalSubmissionRaw\": 3117, \"acRate\": \"79.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"3.1K\", \"totalAcceptedRaw\": 2505, \"totalSubmissionRaw\": 3147, \"acRate\": \"79.6%\"}",
|
||||
"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