Leetcode 124.二叉树中的最大路径和
1.问题描述
2.解决方案
1.思想首先得是后序遍历,根节点拿到左右子树的最大路径和,才能判断当前路径和
2.max = Math.max(max, root.val+leftSum+rightSum) 维护一个最大值就是两边子树,从根节点到某个节点最大值加起来,也就是经过根节点的最大值,也就是左子树的某个节点到右子树的某个节点经过根节点的最大值
3.sum += Math.max(leftSum, rightSum) sum就是从根节点到左右子树的某个节点的最大值,其实是根到子节点
class Solution {
int max = Integer.MIN_VALUE;
public int back(TreeNode root){
if(root==null) return 0;
int leftSum = back(root.left);
int rightSum = back(root.right);
leftSum = leftSum<=0 ? 0 : leftSum;
rightSum = rightSum<=0 ? 0 :rightSum;
// if(leftSum<=0&&rightSum<=0) max = Math.max(max, root.val);
// else if(leftSum<=0) max = Math.max(max, root.val+rightSum);
// else if(rightSum<=0) max = Math.max(max, root.val+leftSum);
// else max = Math.max(max, root.val+leftSum+rightSum);
max = Math.max(max, root.val+leftSum+rightSum);
int sum = root.val;
sum += Math.max(leftSum, rightSum);
// sum = Math.max(sum, sum+Math.max(leftSum, rightSum));
return sum;
}
public int maxPathSum(TreeNode root) {
back(root);
return max;
}
}