mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 398,
|
||||
"likes": 400,
|
||||
"dislikes": 19,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Lowest Common Ancestor of a Binary Search Tree\", \"titleSlug\": \"lowest-common-ancestor-of-a-binary-search-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Lowest Common Ancestor of a Binary Tree\", \"titleSlug\": \"lowest-common-ancestor-of-a-binary-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Lowest Common Ancestor of a Binary Tree III\", \"titleSlug\": \"lowest-common-ancestor-of-a-binary-tree-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Lowest Common Ancestor of a Binary Tree IV\", \"titleSlug\": \"lowest-common-ancestor-of-a-binary-tree-iv\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
@@ -40,7 +40,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"39.5K\", \"totalSubmission\": \"67.3K\", \"totalAcceptedRaw\": 39477, \"totalSubmissionRaw\": 67299, \"acRate\": \"58.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"39.7K\", \"totalSubmission\": \"67.6K\", \"totalAcceptedRaw\": 39653, \"totalSubmissionRaw\": 67568, \"acRate\": \"58.7%\"}",
|
||||
"hints": [
|
||||
"Traverse the graph visiting root, left, root, right, root to make an Euler Path",
|
||||
"Return the node (LCA) that is at the lowest depth between p and q in the Euler Path"
|
||||
|
Reference in New Issue
Block a user