【LeetCode】124.Binary Tree Maximum Path Sum(Hard)解题报告

【LeetCode】124.Binary Tree Maximum Path Sum(Hard)解题报告

题目地址：https://leetcode.com/problems/binary-tree-maximum-path-sum/description/
题目描述：

  Given a non-empty binary tree, find the maximum path sum.

  For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and does not need to go through the root.

Example 1:

Input: [1,2,3]

       1
      / \
     2   3

Output: 6
Example 2:

Input: [-10,9,20,null,null,15,7]

   -10
   / \
  9  20
    /  \
   15   7

Output: 42

Solution:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 postorder
 time : O(n)
 space : O(n)
 */
class Solution {
    int res;
    public int maxPathSum(TreeNode root) {
        if(root == null) return 0;
        res = Integer.MIN_VALUE;
        helper(root);
        return res;
    }
    public int helper(TreeNode root){
        if(root == null) return 0;
        int left = Math.max(0,helper(root.left));
        int right = Math.max(0,helper(root.right));
        res = Math.max(res,left + right + root.val);
        return Math.max(left,right)+root.val;
    }
}

Date：2018年5月4日