mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -3,18 +3,20 @@
|
||||
<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>Example 1:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/ex1.jpg" style="width: 571px; height: 302px;" />
|
||||
<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,5]
|
||||
<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>Example 2:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/ex2.jpg" style="width: 571px; height: 302px;" />
|
||||
<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,5]
|
||||
<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>
|
||||
|
Reference in New Issue
Block a user