coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-23 05:48:57 +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]diameter-of-n-ary-tree.json
View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 23,
"likes": 25,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.8K\", \"totalAcceptedRaw\": 1310, \"totalSubmissionRaw\": 1844, \"acRate\": \"71.0%\"}",
"stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2K\", \"totalAcceptedRaw\": 1412, \"totalSubmissionRaw\": 1982, \"acRate\": \"71.2%\"}",
"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 )."