leetcode 124. Binary Tree Maximum Path Sum

最新推荐文章于 2021-04-30 19:52:08 发布

PaladinDu

最新推荐文章于 2021-04-30 19:52:08 发布

阅读量91

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/u011255131/article/details/104634292

版权

leetcode 专栏收录该内容

64 篇文章 0 订阅

订阅专栏

Given a non-empty binary tree, find the maximum path sum.

For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and does not need to go through the root.

Example 1:

Input: [1,2,3]

       1
      / \
     2   3

Output: 6

Example 2:

Input: [-10,9,20,null,null,15,7]

   -10
   / \
  9  20
    /  \
   15   7

Output: 42

题目计算一个树的所有 "路径的值的合" 最大的值。

DFS 后序遍历树。很容在O(n)中计算到最大值。代码如下：

int max(int i1, int i2){
    return i1 > i2 ? i1 : i2;
}
int getMaxPathSum(struct TreeNode* root,int* result){
    if(root == NULL){
        return 0;
    }
    int ret  = root->val;//root节点开始的单边链路的最大值
    int local = ret;//经过root节点的最大值
    int left = getMaxPathSum(root->left,result);
    int right = getMaxPathSum(root->right,result);
    local += max(0,left) + max(0,right);//尽可能的加上
    ret += max(max(0,left),right);//尽可能加上较大的一边
    result[0] = max(result[0],local);
    return ret;
}
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int maxPathSum(struct TreeNode* root) {
    int result = root->val;
    getMaxPathSum(root,&result);
    return result;
}