/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
void DFS(TreeNode *root,int &tsum,int &maxsum){
if(root==NULL){
tsum=0;
return;
}
int lsum=0,rsum=0;
DFS(root->left,lsum,maxsum);
DFS(root->right,rsum,maxsum);
tsum=max(root->val,max(lsum+root->val,rsum+root->val));
maxsum=max(maxsum,max(tsum,lsum+rsum+root->val));
}
public:
int maxPathSum(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int maxsum=INT_MIN,tsum;
DFS(root,tsum,maxsum);
return maxsum;
}
};
Binary Tree Maximum Path Sum
最新推荐文章于 2022-07-23 04:02:10 发布