给定一个非空二叉树,返回其最大路径和。
本题中,路径被定义为一条从树中任意节点出发,达到任意节点的序列。该路径至少包含一个节点,且不一定经过根节点。
示例 1:
输入: [1,2,3]
1
/ \
2 3
输出: 6
示例 2:
输入: [-10,9,20,null,null,15,7]
-10
/ \
9 20
/ \
15 7
输出: 42
Java代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int maxSum = Integer.MIN_VALUE;
public int maxPathSum(TreeNode root) {
if(null == root)
return 0;
dfs(root);
return maxSum;
}
private int dfs(TreeNode root){
if(null == root)
return 0;
int curVal = root.val, leftSum = dfs(root.left), rightSum = dfs(root.right);
if(0 < leftSum)
curVal += leftSum;
if(0 < rightSum)
curVal += rightSum;
maxSum = Math.max(maxSum, curVal);
return Math.max(root.val, Math.max(root.val+leftSum, root.val+rightSum));
}
}