coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/height-of-binary-tree-after-subtree-removal-queries.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 714,
"likes": 717,
"dislikes": 16,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximum Depth of Binary Tree\", \"titleSlug\": \"maximum-depth-of-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"46.4K\", \"totalAcceptedRaw\": 18159, \"totalSubmissionRaw\": 46387, \"acRate\": \"39.1%\"}",
"stats": "{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"46.4K\", \"totalAcceptedRaw\": 18191, \"totalSubmissionRaw\": 46445, \"acRate\": \"39.2%\"}",
"hints": [
"Try pre-computing the answer for each node from 1 to n, and answer each query in O(1).",
"The answers can be precomputed in a single tree traversal after computing the height of each subtree."