2020-09-29 leetcode-最长同值路径问题【二叉树,递归】
问题描述
思路分析
- 简化问题:假如就分析一个只包含三个节点的二叉树
2. 代码实现
/**
* 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 {
private: int ans;
public:
Solution():ans(0){}
int longestUnivalue(TreeNode* root) {
if(root!=NULL){
int left = longestUnivalue(root->left);
int right = longestUnivalue(root->right);
(root->left!=NULL&&root->left->val==root->val)?left++:left=0;
(root->right!=NULL&&root->right->val==root->val)?right++:right=0;
ans = max(ans,left+right);
return max(left,right);
}else{
return 0;
}
}
int longestUnivaluePath(TreeNode* root){
longestUnivalue(root);
return ans;
}
};
测试用例:
输出:6