mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 23,
|
||||
"likes": 27,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -40,7 +40,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"3.1K\", \"totalAcceptedRaw\": 2505, \"totalSubmissionRaw\": 3147, \"acRate\": \"79.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"3.4K\", \"totalAcceptedRaw\": 2752, \"totalSubmissionRaw\": 3447, \"acRate\": \"79.8%\"}",
|
||||
"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