public:
int maxPathSum(TreeNode* root) {
int maxsum=INT_MIN;
dfs(root,maxsum);
return maxsum;
}
int dfs(TreeNode* root,int& maxsum)
{
if(root==NULL) return 0;
int l=max(0,dfs(root->left,maxsum));
int r=max(0,dfs(root->right,maxsum));
maxsum=max(l+r+root->val,maxsum);
return root->val+max(l,r);
}
这是一个Hard型,开始我是没有思路了,看了discuss之后感觉其实没那么难