/**
* 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:
int ans=0x80000000;
int P(TreeNode* root) {
if(!root) return -0x3f3f3f3f;
int L=P(root->left),R=P(root->right),t=root->val;
t=max(t,root->val+L),t=max(t,root->val+R);
ans=max(ans,max(max(t,root->val+L+R),max(L,R)));
return t;
}
int maxPathSum(TreeNode* root) {
P(root);
return ans;
}
};
Leetcode 124. 二叉树中的最大路径和
最新推荐文章于 2024-08-14 09:54:52 发布