687. Longest Univalue Path

最新推荐文章于 2025-12-06 07:43:37 发布

转载最新推荐文章于 2025-12-06 07:43:37 发布 · 279 阅读

文章标签：

#algorithms #leetcode #Dynamic Programming

algorithms 专栏收录该内容

26 篇文章

订阅专栏

本文介绍了一个二叉树问题的解决方案：寻找最长路径，该路径上的所有节点都具有相同的值。此路径可以不经过根节点。文章提供了一段C++代码实现，通过递归方式计算从根节点开始左右子树中相同值节点的最长路径。

Problem:

Given a binary tree, find 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.

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

Solution:

class Solution {
public:
int longestUnivaluePath(TreeNode* root) {
if (root == NULL)
return 0;
return max(longestUnivaluePath(root->left) + 1, longestUnivaluePath(root->right) + 1);
}
};