Leetcode124. 二叉树中的最大路径和

Binary Tree Maximum Path Sum
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

class Solution {
    int max = Integer.MIN_VALUE;
    public int maxPathSum(TreeNode root) {
        dfs(root);
        return max;
    }

    private int dfs(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int leftSum = Math.max(0, dfs(root.left)); // 和上题唯一的区别在这里，如果左右孩子的结果是负数的话就舍弃。
        int rightSum = Math.max(0, dfs(root.right));
       
        max = Math.max(max, leftSum + rightSum + root.val);
        //返回树中从根节点开始 最大的路径
        return Math.max(leftSum, rightSum) + root.val;
    }
}