【LeetCode】124. 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: 

链接：https://leetcode.com/problems/binary-tree-maximum-path-sum/description/

题解：动态规划，这里用向后的方法，题目要求的是最长路径，直接用DP的话由于这条路径经过左右子树不好递归，所以先求出以每一点为开头向后延长的最长路径，用dp来表示就是【root】= max（0，max（root->left,root->right））+root->val，要求出题解的最长路径只要在递归时更新ans，即ans=max（ans，root->val+max(0,root->left)+max(0,root->right)），本质上就是通过递归访问每个根节点时是否需要加入最长路径来更新ans

class Solution {
public:
    int maxPathSum(TreeNode* root) {
        maxPathDown(root);
        return ans;
    }
    int maxPathDown(TreeNode* root){
        if(root==NULL) return 0;
        int left=max(0,maxPathDown(root->left));
        int right=max(0,maxPathDown(root->right));
        ans=max(ans,root->val+left+right);
        return root->val+max(0,max(left,right));
    }
private:
    int ans=INT_MIN;
    
};