mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
30 lines
1.3 KiB
HTML
30 lines
1.3 KiB
HTML
<p>Given the <code>root</code> of a binary tree, return <em>the length of the longest path, where each node in the path has the same value</em>. This path may or may not pass through the root.</p>
|
|
|
|
<p><strong>The length of the path</strong> between two nodes is represented by the number of edges between them.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/ex1.jpg" style="width: 450px; height: 238px;" />
|
|
<pre>
|
|
<strong>Input:</strong> root = [5,4,5,1,1,null,5]
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong> The shown image shows that the longest path of the same value (i.e. 5).
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/ex2.jpg" style="width: 450px; height: 238px;" />
|
|
<pre>
|
|
<strong>Input:</strong> root = [1,4,5,4,4,null,5]
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong> The shown image shows that the longest path of the same value (i.e. 4).
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li>The number of nodes in the tree is in the range <code>[0, 10<sup>4</sup>]</code>.</li>
|
|
<li><code>-1000 <= Node.val <= 1000</code></li>
|
|
<li>The depth of the tree will not exceed <code>1000</code>.</li>
|
|
</ul>
|