coder-xiaomo/leetcode-problemset
1
0
Fork 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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/originData/[no content]lowest-common-ancestor-of-a-binary-tree-ii.json
View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 22,
"likes": 24,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"3.5K\", \"totalAcceptedRaw\": 1914, \"totalSubmissionRaw\": 3467, \"acRate\": \"55.2%\"}",
"stats": "{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"3.9K\", \"totalAcceptedRaw\": 2146, \"totalSubmissionRaw\": 3942, \"acRate\": \"54.4%\"}",
"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"