思路,从下往上遍历,注意,以当前值为根节点的最大值,是左子树加右子树,但是向上传值的时候,则是只能选择更大的一边的子树,否则不再是一条路径。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int an = 0;
int longestUnivaluePath(TreeNode* root) {
if(root != nullptr){
dfs(0, -1, root);
}
return an;
}
int dfs(int pl, int pv, TreeNode *node){
int nl,nv;
nv = node->val;
nl = 0;
int nll,nlr;
nll = nlr = 0;
if(node->left != nullptr){
int t = dfs(nl, nv, node->left);
if(node->val == node->left->val){
nll += t + 1;
}
}
if(node->right != nullptr){
int t = dfs(nl, nv, node->right);
if(node->val == node->right->val){
nlr += t + 1;
}
}
an = max(an, nll + nlr);
return max(nll, nlr);
}
};