[leetcode刷题系列]Binary Tree Maximum Path Sum

简单的dfs，不过由于节点的权重有正有负， 所以没有一次性写对， 以为全是正的。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
    int dfs(TreeNode *root, int& ret){
        if(root == 0)
            return 0;
        int son1 = dfs(root->left, ret);
        int son2 = dfs(root->right, ret);
        ret = max(ret, root->val + max(0,son1) + max(0, son2));
        return root->val + max(0, max(son1, son2));
    }
public:
    int maxPathSum(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(root == 0)
            return 0;
        int ans = root->val;
        int ret = dfs(root, ans);
        ans = max(ans, ret);
        return ans;
    }
};