[LintCode]Binary Tree Maximum Path Sum II
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/**
* @param root the root of binary tree.
* @return an integer
*/
public int maxPathSum2(TreeNode root) {
// 2016-03-08
// node value may <= 0 and the path contain at least one node
if (root == null) {
return 0;
}
int tempRst = sumHelper(root);
if (tempRst == 0) {
return root.val;
} else {
return tempRst;
}
}
private int sumHelper(TreeNode root) {
if (root == null) {
return 0;
}
int leftSum = root.val + maxPathSum2(root.left);
int rightSum = root.val + maxPathSum2(root.right);
int bigger = Math.max(leftSum, rightSum);
return Math.max(bigger, 0);
}
}