Binary Tree Maximum Path Sum

/**
 * 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 res = INT_MIN;
        dfs(root,res);
        return res;
    }
    int dfs(TreeNode* root,int & res)
    {
        if (!root)
            return 0;
        int left = dfs(root->left,res);
        int right = dfs(root->right,res);
        int cur = root->val + (left > 0 ? left : 0) + (right > 0 ? right : 0);
        res = max(res,cur);
        return root->val + max(max(left,right),0);
    }
};

参考了 http://blog.csdn.net/linhuanmars/article/details/22969069