1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1151,
"likes": 1154,
"dislikes": 733,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Lowest Common Ancestor of a Binary Tree IV\", \"titleSlug\": \"lowest-common-ancestor-of-a-binary-tree-iv\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"72.8K\", \"totalSubmission\": \"104K\", \"totalAcceptedRaw\": 72814, \"totalSubmissionRaw\": 104004, \"acRate\": \"70.0%\"}",
"stats": "{\"totalAccepted\": \"72.9K\", \"totalSubmission\": \"104.2K\", \"totalAcceptedRaw\": 72926, \"totalSubmissionRaw\": 104168, \"acRate\": \"70.0%\"}",
"hints": [
"Do a postorder traversal.",
"Then, if both subtrees contain a deepest leaf, you can mark this node as the answer (so far).",