[leetcode]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 {//c++
public:
    int helper(TreeNode* root,int &m){
        if(root==0){//递归终止条件
            return 0;
        }
        int left=helper(root->left,m);
        int right=helper(root->right,m);
        int ret=max(max(left,right),0)+root->val;//注意可能为负数,子树单向延伸
        m=max(max(m,ret),left+right+root->val);
        return ret;
    }

    int maxPathSum(TreeNode* root) {
        if(root==0){
            return 0;
        }
        int res=root->val;
        helper(root,res);
        return res;
    }
};

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {//java

    public int helper(TreeNode root,TreeNode res){
        if(root==null){
            return 0;
        }else{
            int left=helper(root.left,res);
            int right=helper(root.right,res);
            int ret=Math.max(Math.max(left,right),0)+root.val;//单向延伸
            //System.out.println("ret:"+ret);
            res.val=Math.max(Math.max(res.val,ret),left+right+root.val);//倒V型延伸
            return ret;//单向延伸的最大值
        }
    }

    public int maxPathSum(TreeNode root) {

        if(root==null){
            return 0;
        }
        TreeNode res=new TreeNode(-0x7f7f7f7f);//min int 
        helper(root,res);
        return res.val;
    }


}