Leetcode Binary Tree Maximum Path Sum

Given a 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.

For example:
Given the below binary tree,

       1
      / \
     2   3

Return 6.

代码如下：

/**
 * 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 maxPathSum(TreeNode* root) {
        int result=0x80000000;
        PathSum(root,result);
        return result;
    }
    
    int PathSum(TreeNode* root,int& result)
    {
        if(!root)
            return 0;
        
        int left = max(0,PathSum(root->left,result));
        int right = max(0,PathSum(root->right,result));
        
        result = max(result,left+right+root->val);
        
        return max(left,right)+root->val;
    }
};