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.
Example 1:
Input:
5 / \ 4 5 / \ \ 1 1 5
Output:
2
Example 2:
Input:
1 / \ 4 5 / \ \ 4 4 5
Output:
2
Note: The given binary tree has not more than 10000 nodes. The height of the tree is not more than 1000.
SOLVE:
class Solution {
public:
int longestUnivaluePath(TreeNode* root) {
int lup = 0;
if (root) dfs(root, lup);
return lup;
}
private:
int dfs(TreeNode* node, int& lup) {
//lup:以node为根节点的树中最长路径
int l = node->left ? dfs(node->left, lup) : 0; //l:左子树从根节点开始的最长路径 //注意:不一定是左子树的最长路径 //lup:更新为左子树的最长路径
int r = node->right ? dfs(node->right, lup) : 0; //r:右子树从根节点开始的最长路径 //注意:不一定是右子树的最长路径 //lup:更新为左子树及右子树中的最长路径
int resl = node->left && node->left->val == node->val ? l + 1 : 0;
int resr = node->right && node->right->val == node->val ? r + 1 : 0;
lup = max(lup, resl + resr); //lup:更新后为以node为根节点的树中最长路径 //注意:路径是边数,而不是节点数
return max(resl, resr); //从根节点开始的最长路径
}
};