longest-univalue-path

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the <code>root</code> of a binary tree, return the length of the longest path, where each node in the path has the same value. This path may or may not pass through the root.

The length of the path between two nodes is represented by the number of edges between them.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/ex1.jpg" style="width: 450px; height: 238px;" />
<pre>
Input: root = [5,4,5,1,1,null,5]
Output: 2
Explanation: The shown image shows that the longest path of the same value (i.e. 5).
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/ex2.jpg" style="width: 450px; height: 238px;" />
<pre>
Input: root = [1,4,5,4,4,null,5]
Output: 2
Explanation: The shown image shows that the longest path of the same value (i.e. 4).
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[0, 104]</code>.</li>
	<li><code>-1000 &lt;= Node.val &lt;= 1000</code></li>
	<li>The depth of the tree will not exceed <code>1000</code>.</li>
</ul>

longestUnivaluePath

Longest Univalue Path

Binary Tree Maximum Path Sum

binary-tree-maximum-path-sum

二叉树中的最大路径和

Count Univalue Subtrees

count-univalue-subtrees

统计同值子树

Path Sum III

path-sum-iii

路径总和 III

Longest Path With Different Adjacent Characters

longest-path-with-different-adjacent-characters

相邻字符不同的最长路径

Tree

Depth-First Search

Binary Tree

给定一个二叉树的<meta charset="UTF-8" />&nbsp;<code>root</code>&nbsp;，返回&nbsp;最长的路径的长度 ，这个路径中的&nbsp;每个节点具有相同值&nbsp;。 这条路径可以经过也可以不经过根节点。

两个节点之间的路径长度&nbsp;由它们之间的边数表示。

&nbsp;

示例 1:

<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/ex1.jpg" />

<pre>
输入：root = [5,4,5,1,1,5]
输出：2
</pre>

示例 2:

<img alt="" src="https://assets.leetcode.com/uploads/2020/10/13/ex2.jpg" />

<pre>
输入：root = [1,4,5,4,4,5]
输出：2
</pre>

&nbsp;

提示:

<ul>
	<li>树的节点数的范围是<meta charset="UTF-8" />&nbsp;<code>[0, 104]</code>&nbsp;</li>
	<li><code>-1000 &lt;= Node.val &lt;= 1000</code></li>
	<li>树的深度将不超过 <code>1000</code>&nbsp;</li>
</ul>