coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-19 12:06:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
leetcode-cn/problem (Chinese)/二叉树的直径 [diameter-of-binary-tree].html Normal file
View File

@@ -0,0 +1,19 @@
<p>给定一棵二叉树，你需要计算它的直径长度。一棵二叉树的直径长度是任意两个结点路径长度中的最大值。这条路径可能穿过也可能不穿过根结点。</p>
<p>&nbsp;</p>
<p><strong>示例 :</strong><br>
给定二叉树</p>
<pre> 1
/ \
2 3
/ \
4 5
</pre>
<p>返回&nbsp;<strong>3</strong>, 它的长度是路径 [4,2,1,3] 或者&nbsp;[5,2,1,3]。</p>
<p>&nbsp;</p>
<p><strong>注意：</strong>两结点之间的路径长度是以它们之间边的数目表示。</p>