实现思路:
首先想到的是动态规划 + 后序遍历搜索。
1
/ \
2 3
maxPathValue = rightValue + leftValue + root.val;
maxPathValue = 3 + 2 +1
leftValue 是左边分支最大的路径
rightValue 是右边分支最大的路径
设置一个全局变量,用来存储最长的路径
但如何存储rightValue 和leftValue 呢?
我是直接令 root.val = max{root.left,root.right}+root.value。
方法比较NIVEA
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
int maxValue = Integer.MIN_VALUE;
public int maxPathSum(TreeNode root) {
traverse(root);
return maxValue;
}
public void traverse(TreeNode root)
{
if(root == null){return;}
traverse(root.left);
traverse(root.right);
int maxPathValue = 0;
if(root.left == null && root.right == null)
{
maxPathValue = root.val;
}
if(root.left == null && root.right != null)
{
int val = root.right.val>0?root.right.val:0;
maxPathValue = root.val + val;
root.val += val;
}
if(root.left != null &&root.right == null)
{
int val = root.left.val>0?root.left.val:0;
maxPathValue = root.val + val;
root.val += val;
}
if(root.left != null && root.right != null)
{
int val_right = root.right.val>0?root.right.val:0;
int val_left = root.left.val>0?root.left.val:0;
maxPathValue = root.val + val_left + val_right;
root.val += Math.max(val_right, val_left);
}
if(maxPathValue>maxValue){maxValue = maxPathValue;}
}
}