124. 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 maxValue;
    int maxPathSum(TreeNode* root) {
        if(root == NULL) return 0;
        maxValue = INT_MIN;
        maxRootPath(root);
        return maxValue;
    }
    
    int maxRootPath(TreeNode* root){//以root为终点
        if(root == NULL) return 0;
        //if(root->left == NULL && root->right == NULL) return root->val; 这一行多于。
        int maxl = maxRootPath(root->left);
        int maxr = maxRootPath(root->right);
        maxValue = max(maxValue,(maxl > 0 ? maxl : 0) + (maxr > 0 ? maxr : 0) + root->val );//在这里更新包含当前节点的最大值
        return root->val + max((maxl > 0 ? maxl : 0),(maxr > 0 ? maxr : 0));
    }
};