LeetCode: https://oj.leetcode.com/problems/binary-tree-maximum-path-sum/
对于某一条路径,一定可以找到一个根节点,该路径上的其余节点分别处于该节点的左子树和右子树中,很显然,我们可以考虑用递归的方法解决:对于某个节点,找到左子树的最大路径(left),右子树的最大路径(right);则以该节点为根的最大路径为 node.val + Math.max(left, 0) + Math.max(right, 0) ,将该值与现存的max值比较取其大者;同时向上层返回 node.val + Math.max(Math.max(left, 0) + Math.max(right, 0))
代码如下:
public class Solution {
private int max = Integer.MIN_VALUE;
public int maxPathSum(TreeNode root) {
pathSum(root);
return max;
}
public int pathSum(TreeNode root){
if(root == null){
return Integer.MIN_VALUE;
}
int left = Math.max(pathSum(root.left), 0);
int right = Math.max(pathSum(root.right), 0);
int sum = root.val + left + right;
if(sum > max)
max = sum;
return (left > right) ? (left+root.val) : (right+root.val);
}
}