124. Binary Tree Maximum Path Sum
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
Solution
C++
/**
* 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 max_val = INT_MIN;
int maxPathSum(TreeNode* root) {
int tmp = dfs(root);
return max_val;
}
int dfs(TreeNode* node) {
if(node == NULL) return 0;
int left = max(0, dfs(node->left));
int right = max(0, dfs(node->right));
max_val = max(max_val, left+right+node->val);
return max(left,right)+node->val;
}
};
Explanation