题目:
Given a non-empty binary tree, find the maximum path sum.
For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and does not need to go through the root.
Example 1:
Input: [1,2,3] 1 / \ 2 3 Output: 6
Example 2:
Input: [-10,9,20,null,null,15,7] -10 / \ 9 20 / \ 15 7 Output: 42
代码:
/**
* 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 backSum(TreeNode* root, int& sum) {
if(root == NULL)
return 0;
int left = backSum(root->left, sum);
int right = backSum(root->right, sum);
if(left < 0)
left = 0;
if(right < 0)
right = 0;
if(root->val + left + right > sum)
sum = root->val + left + right;
return root->val + max(left, right);
}
int maxPathSum(TreeNode* root) {
if(root == NULL)
return 0;
int sum = -2147483648;
backSum(root, sum);
return sum;
}
};
hard难度,一遍AC,并且C++种类优于99.0%~不要膨胀啊!