1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 394,
"likes": 395,
"dislikes": 15,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Step-By-Step Directions From a Binary Tree Node to Another\", \"titleSlug\": \"step-by-step-directions-from-a-binary-tree-node-to-another\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -52,7 +52,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 20906, \"totalSubmissionRaw\": 29882, \"acRate\": \"70.0%\"}",
"stats": "{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 20912, \"totalSubmissionRaw\": 29888, \"acRate\": \"70.0%\"}",
"hints": [
"Get the LCA of p and q.",
"The answer is the sum of distances between p-LCA and q-LCA"