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.
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int longestUnivaluePath(TreeNode* root) {
int len=0;
if (root)
dfs(root, len);
return len;
}
int dfs(TreeNode* node, int& len) {
int l = node->left ? dfs(node->left, len) : 0;
int r = node->right ? dfs(node->right, len) : 0;
int l_root = node->left && node->left->val == node->val ? l + 1 : 0;
int r_root = node->right && node->right->val == node->val ? r + 1 : 0;
len = max(len, l_root + r_root);
return max(l_root,r_root);
}
};
这个题居然难度是easy...