描述:
给出一棵二叉树,寻找一条路径使其路径和最大,路径可以在任一节点中开始和结束(路径和为两个节点之间所在路径上的节点权值之和)
样例:
给出一棵二叉树:
1 / \ 2 3
返回 6
思路:
一个节点线看作根节点,计算当前路径的最大值,然后看作子节点,计算当前分支的最大值,计算并返回
/**
* 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 maxPathSum(TreeNode root) {
// write your code here
if(root == null){
return 0;
}
ArrayList<Integer> result = new ArrayList<Integer>();
result.add(Integer.MIN_VALUE);
int temp = search(root , result);
return result.get(0);
}
public int search(TreeNode root , ArrayList<Integer> result){
if(root == null){
return 0;
}
int left = search(root.left , result);
int right = search(root.right , result);
int current = root.val + (left>0?left:0) + (right>0?right:0);
int temp = Math.max(current , result.get(0));
result.set(0 , temp);
return root.val+Math.max(left , Math.max(right , 0));
}
}