LeetCode之Binary Tree Maximum Path Sum

 /* 参考自：http://www.cnblogs.com/TenosDoIt/p/3435366.html*/class Solution {public:    int maxPathSum(TreeNode* root) {        if(root == nullptr) return 0;        int maxPath = INT_MIN;        maxPathSum(root, maxPath);        return maxPath;    }        int maxPathSum(TreeNode *root, int &maxPath){        //if(root == nullptr) return 0;        int left(0), right(0);        if(root->left) left = maxPathSum(root->left, maxPath);        if(root->right) right = maxPathSum(root->right, maxPath);        int tmp = max(root->val, max(root->val+left, root->val+right));        maxPath = max(maxPath, max(tmp, root->val + left + right));        return tmp;    }};