题目链接:https://leetcode.cn/problems/binary-tree-maximum-path-sum/
题目如下:
/**
* 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 maxPathSum(TreeNode* root) {
//思路:即左子树的最大路径合+右子树的最大路径和
//可用递归思想来实现
dfs(root);
return res;
}
int dfs(TreeNode* root){
if(!root) return 0;
int leftmax=dfs(root->left);
int rightmax=dfs(root->right);
//计算当前情况下二叉树中的最大路径和,即每次要和res比大小
int maxpath=root->val;
if(leftmax>0) maxpath+=leftmax;
if(rightmax>0) maxpath+=rightmax;
if(maxpath>res) res=maxpath;
//返回当前节点下的最大路径(左子树还是右子树,包含当前节点)
int cur=root->val;
if(cur<leftmax+root->val) cur=leftmax+root->val;
if(cur<rightmax+root->val) cur=rightmax+root->val;
return cur;
}
private:
int res=INT_MIN;
};