题目:
给定一个非空二叉树,返回其最大路径和。
本题中,路径被定义为一条从树中任意节点出发,达到任意节点的序列。该路径至少包含一个节点,且不一定经过根节点。
示例 1:
输入: [1,2,3]
1
/ \
2 3
输出: 6
示例 2:
输入: [-10,9,20,null,null,15,7]
-10
/ \
9 20
/ \
15 7
输出: 42
算法:
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int x) { val = x; }
* }
*/
public class Solution
{
private int maxpath = int.MinValue;
public int MaxPathSum(TreeNode root)
{
MaxPath(root, maxpath);
return maxpath;
}
public int MaxPath(TreeNode root, int val)
{
if (root == null) return 0;
int left = Math.Max(MaxPath(root.left, maxpath), 0);
int right = Math.Max(MaxPath(root.right, maxpath), 0);
maxpath = Math.Max(maxpath, left + right + root.val);
return Math.Max(left + root.val, right + root.val);
}
}
测试用例:
执行结果: