(1)当前结点可能为转折点,也可能不是
/**
* 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 {
private:
int maxs=INT_MIN;
public:
int helper(TreeNode *root) {
if(!root) return 0;
int left=helper(root->left);
int right=helper(root->right);
int temp=max(left,right);
if(temp>=0) temp+=root->val;
else temp=root->val;
maxs=max(maxs,max(temp,left+right+root->val));
return temp;
}
int maxPathSum(TreeNode* root) {
helper(root);
return maxs;
}
};