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

代码：

/**
 * 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 {
public:
    int maxPathSumHelp(TreeNode* root, int &maxPath)
    {
        if(root == nullptr)
            return 0;  
        int left = root->val + maxPathSumHelp(root->left, maxPath);
        int right = root->val + maxPathSumHelp(root->right, maxPath);
        maxPath = max(max(left,right),max(root->val, max(maxPath, left+right-root->val)));
        return max(max(left, right), root->val);
    }
    int maxPathSum(TreeNode* root) {
        if(root == nullptr)
            return 0;
        int maxPath = INT32_MIN;
        maxPathSumHelp(root, maxPath);
        return maxPath;
    }
};