LeetCode 124. Binary Tree Maximum Path Sum（递归）

最新推荐文章于 2020-09-24 07:38:59 发布

da_kao_la

最新推荐文章于 2020-09-24 07:38:59 发布

阅读量167

点赞数

分类专栏： LeetCode 文章标签： LeetCode Hard Cpp 递归

本文链接：https://blog.csdn.net/da_kao_la/article/details/91416955

版权

LeetCode 专栏收录该内容

371 篇文章 0 订阅

订阅专栏

Binary Tree Maximum Path Sum

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]

Output: 42

题意

求二叉树中的最大的可以拐弯的路径

代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
private:
    int maxPath = numeric_limits<int>::min();

    /**
     * 输入节点，返回以该节点为根节点的不拐弯路径的最长路径
     * 同时计算以该节点为根节点的最长路径，维护maxPath
     */
    int rootMax(TreeNode* root) {
        if (!root) {
            return 0;
        }
        int ret = root->val, addi = 0, rootmax = root->val;
        if (root->left) {
            int lv = rootMax(root->left);
            addi = max(lv, addi);
            rootmax += max(lv, 0);
        }
        if (root->right) {
            int rv = rootMax(root->right);
            addi = max(rv, addi);
            rootmax += max(rv, 0);
        }
        ret += addi;
        this->maxPath = max(this->maxPath, rootmax);
        return ret;
    }
public:
    int maxPathSum(TreeNode* root) {
        rootMax(root);
        return this->maxPath;
    }
};