leetcode 日经贴，Cpp code -Binary Tree Maximum Path Sum

Binary Tree Maximum Path Sum

/**
 * Definition for binary tree
 * 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 &cur) {
        if (!root) {
            return 0;
        }
        int a = maxPathSum(root->left, cur);
        int b = maxPathSum(root->right, cur);
        cur = max(cur, max(a, b) + root->val);
        cur = max(cur, a + b + root->val);
        return max(root->val, root->val + max(a, b));
    }
    int maxPathSum(TreeNode *root) {
        if (!root) return 0;
        int cur = root->val;
        maxPathSum(root, cur);
        return cur;
    }
};