coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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/originData/[no content]diameter-of-n-ary-tree.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 409,
"likes": 428,
"dislikes": 6,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Diameter of Binary Tree\", \"titleSlug\": \"diameter-of-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 29273, \"totalSubmissionRaw\": 40132, \"acRate\": \"72.9%\"}",
"stats": "{\"totalAccepted\": \"30.9K\", \"totalSubmission\": \"42.3K\", \"totalAcceptedRaw\": 30897, \"totalSubmissionRaw\": 42290, \"acRate\": \"73.1%\"}",
"hints": [
"For the node i, calculate the height of each of its children and keep the first and second maximum heights (max1_i , max2_i).",
"Check all nodes and return max( 2 + max1_i + max2_i )."