mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 814,
|
||||
"dislikes": 24,
|
||||
"likes": 867,
|
||||
"dislikes": 26,
|
||||
"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 II\", \"titleSlug\": \"lowest-common-ancestor-of-a-binary-tree-ii\", \"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}]",
|
||||
"exampleTestcases": "[3,5,1,6,2,0,8,null,null,7,4]\n5\n1\n[3,5,1,6,2,0,8,null,null,7,4]\n5\n4\n[1,2]\n1\n2",
|
||||
@@ -40,7 +40,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"109.2K\", \"totalSubmission\": \"141.2K\", \"totalAcceptedRaw\": 109247, \"totalSubmissionRaw\": 141193, \"acRate\": \"77.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"118K\", \"totalSubmission\": \"152.5K\", \"totalAcceptedRaw\": 118020, \"totalSubmissionRaw\": 152486, \"acRate\": \"77.4%\"}",
|
||||
"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