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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/[no content]diameter-of-n-ary-tree.json
View File

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.8K\", \"totalAcceptedRaw\": 1302, \"totalSubmissionRaw\": 1834, \"acRate\": \"71.0%\"}",
"stats": "{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.8K\", \"totalAcceptedRaw\": 1310, \"totalSubmissionRaw\": 1844, \"acRate\": \"71.0%\"}",
"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 )."