题目描述:
给定一个非空二叉树,返回其最大路径和。
本题中,路径被定义为一条从树中任意节点出发,达到任意节点的序列。该路径至少包含一个节点,且不一定经过根节点。
示例 1:
输入: [1,2,3]
1
/ \
2 3
输出: 6
示例 2:
输入: [-10,9,20,null,null,15,7]
-10
/
9 20
/
15 7
输出: 42
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-maximum-path-sum
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解题代码:
/**
* 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:
map<TreeNode*,int> maxSum;
map<TreeNode*,int> upSum;
int ans = -2147483648;
void dp_up(TreeNode* r){
maxSum[r] = r->val;
if(r->left == NULL && r->right == NULL){
return;
}
if(r->left) dp_up(r->left);
if(r->right) dp_up(r->right);
int tmp = max(maxSum[r->left],maxSum[r->right]);
maxSum[r] = max(maxSum[r],maxSum[r]+tmp);
}
void dp_down(TreeNode* r){
if(r->left == NULL && r->right == NULL){
return;
}
if(r->left){
int tmp = max(r->val + (r->right == NULL ? 0 : maxSum[r->right]),
r->val + upSum[r]) ;
upSum[r->left] = max(upSum[r->left],upSum[r->left] + tmp);
dp_down(r->left);
}
if(r->right){
int tmp = max(r->val + (r->left == NULL ? 0 : maxSum[r->left]),
r->val + upSum[r]);
upSum[r->right] = max(upSum[r->right],upSum[r->right] + tmp);
dp_down(r->right);
}
}
void dfs(TreeNode* r){
if(r->left == NULL && r->right == NULL){
ans = max(ans,maxSum[r]+upSum[r]);
//ans = max(ans,r->val+upSum[r]);
return;
}
ans = max(ans,maxSum[r]+upSum[r]);
//ans = max(ans,r->val+upSum[r]);
if(r->left) dfs(r->left);
if(r->right) dfs(r->right);
}
int maxPathSum(TreeNode* root) {
dp_up(root);
dp_down(root);
dfs(root);
return ans;
}
};
运行结果: