112_leetcode_Binary Tree Maximum Path

最新推荐文章于 2024-09-27 15:30:00 发布

ezzffzz

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量424

点赞数

分类专栏：算法 leetcode 编程文章标签： leetcode 算法编程语言面试

本文链接：https://blog.csdn.net/ezzffzz/article/details/34090095

版权

算法同时被 3 个专栏收录

155 篇文章 0 订阅

订阅专栏

leetcode

155 篇文章 0 订阅

订阅专栏

编程

155 篇文章 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.

1:递归；2:后序遍历；3:节点的值是负数

       int maxPathSum(TreeNode *root)
    {
        if(root == NULL)
        {
            return 0;
        }
        if(!root->left && !root->right)
        {
            return root->val;
        }
        
        int value = INT_MIN;
        
        maxPathSumCore(root, value);
        
        return value;
    }
    
    int maxPathSumCore(TreeNode *root, int &value)
    {
        if(root == NULL)
        {
            return 0;
        }
        
        int leftLength = maxPathSumCore(root->left, value);
        int rightLength = maxPathSumCore(root->right, value);
        
        int curLength = max(root->val, root->val + max(leftLength, rightLength));
        
        int tempValue = max(curLength, leftLength + rightLength + root->val);
        
        if(tempValue > value)
        {
            value = tempValue;
        }
        
        return curLength;
    }