Leetcode 124. Binary Tree Maximum Path Sum
题目链接: Most Frequent Subtree Sum
难度:Hard
题目大意:
详见题目。
思路:
本题思路与Leetcode543类似。参考高赞回答。
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
int max=Integer.MIN_VALUE;
public int maxPathSum(TreeNode root) {
maxPathDown(root);
return max;
}
public int maxPathDown(TreeNode root){//从下而下的路径的最大路径和
if(root==null){
return 0;
}
int left=Math.max(0,maxPathDown(root.left));//如果小于0则不加入路径
int right=Math.max(0,maxPathDown(root.right));
max=Math.max(max,left+right+root.val);
return Math.max(left,right)+root.val;
}
}