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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 566,
"likes": 567,
"dislikes": 8,
"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\": \"42.1K\", \"totalSubmission\": \"57.1K\", \"totalAcceptedRaw\": 42136, \"totalSubmissionRaw\": 57058, \"acRate\": \"73.8%\"}",
"stats": "{\"totalAccepted\": \"42.1K\", \"totalSubmission\": \"57.1K\", \"totalAcceptedRaw\": 42146, \"totalSubmissionRaw\": 57071, \"acRate\": \"73.8%\"}",
"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 )."