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: 42

求二叉树中最大的路径和，路径不一定记过根节点。由于不经过根节点，可以利用递归，每次遍历到了一个节点，都可以从它开始向两边子树求路径和。

class Solution {
public:
    int maxPathSum(TreeNode* root) {
        int result=INT_MIN;
        preorder(root,result);
        return result;
    }
    
    void preorder(TreeNode* root, int& result)
    {
        if(root==NULL) return;
        int path_sum=root->val
            +from_root(root->left)+from_root(root->right);
        result=max(result,path_sum);
        preorder(root->left,result);
        preorder(root->right,result);
    }
    
    int from_root(TreeNode* root)
    {
        if(root==NULL) return 0;
        int left_sum=max(0,from_root(root->left));
        int right_sum=max(0,from_root(root->right));
        return max(0,root->val+max(left_sum,right_sum));
    }
};