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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"29.2K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 29152, \"totalSubmissionRaw\": 39949, \"acRate\": \"73.0%\"}",
"stats": "{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 29273, \"totalSubmissionRaw\": 40132, \"acRate\": \"72.9%\"}",
"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 )."