124. Binary Tree Maximum Path Sum

weixin_34138377

于 2019-06-29 11:58:15 发布

阅读量181

点赞数 1

原文链接：http://www.cnblogs.com/asuran/p/7623106.html

版权

class Solution {
    int maxPathSum;
    public int maxPathSum(TreeNode root) {
        maxPathSum=Integer.MIN_VALUE;
        seachPathSum(root);
        return maxPathSum;
    }
    private int seachPathSum(TreeNode node){
        if(node==null)
            return 0;
        int left=Math.max(0, seachPathSum(node.left));
        int right=Math.max(0, seachPathSum(node.right));
        maxPathSum=Math.max(left+right+node.val, maxPathSum);
        return Math.max(left, right)+node.val;
    }
}

转载于:https://www.cnblogs.com/asuran/p/7623106.html