LeetCode124: 二叉树中的最大路径和

https://leetcode.com/problems/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]

   -10
   / \
  9  20
    /  \
   15   7

Output: 42

解题思路

递归法

Solution

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int maxPathSum(TreeNode* root) {
        int res=INT_MIN;
        postOrderTraverse(root,res);
        return res;
    }
    
    int postOrderTraverse(TreeNode* root,int &res)
    {
        if(root==NULL)
            return 0;
        int leftVal=postOrderTraverse(root->left,res);
        int rightVal=postOrderTraverse(root->right,res);
        if(leftVal<0)
            leftVal=0;
        if(rightVal<0)
            rightVal=0;
        res=max(res,leftVal+rightVal+root->val);
        return max(leftVal,rightVal)+root->val;
    }
};