Binary Tree Maximum Path Sum(LeetCode)

最新推荐文章于 2022-06-17 14:44:33 发布

kyoto_hu

最新推荐文章于 2022-06-17 14:44:33 发布

阅读量312

点赞数

分类专栏： LeetCode 文章标签： LeetCode java 递归二叉树

本文链接：https://blog.csdn.net/kyoto_hu/article/details/38341783

版权

LeetCode 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

题目：

难度级别: ★★★

Given a binary tree, find the maximum path sum.

The path may start and end at any node in the tree.

For example:
Given the below binary tree,

       1
      / \
     2   3

Return 6.

题目分析：题目要求在一个二叉树中，找出一条路径能经过的最大和。这条路径可以以二叉树中任何一个节点为起点和终点。

思路：

暂略

代码：

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    static int max;
    public int maxPathSum(TreeNode root) {
        if (root == null){
            return 0;
        }
        max = root.val;
        getPathSum(root);
        return max;
    }
    
    static int getPathSum(TreeNode root){
        if (root == null){
            return 0;
        }
        int lsum,rsum;
        int sum = root.val;
        lsum = getPathSum(root.left);
        rsum = getPathSum(root.right);
        //find the max sum from left child to right child via root, compare the result with max
        if (lsum > 0){
            sum += lsum;
        }
        if (rsum > 0){
            sum += rsum;
        }
        if (sum > max){
            max = sum;
        }
        //choose either or neither of rsum and lsum, plus root.val as the result to return to the up level
        if (rsum > 0 && rsum >= lsum){
            return rsum + root.val;
        }else if (lsum > 0 && lsum >= rsum){
            return lsum + root.val;
        }
        return root.val;
    }
}