题目原文:
Given a 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 does not need to go through the root.
For example:
Given the below binary tree,
1
/ \
2 3
Return 6.
题目大意:
给出一棵二叉树,求出和最大的一条路径。
题目分析:
递归求出每棵子树的最大和,然后分为三种情况:最大和路径在左子树,最大和路径在右子树,最大和路径在根节点,据此更新所有递归过程的最大值即可。
源码:(language:java)
public class Solution {
public int max = Integer.MIN_VALUE;
public int maxPathSum(TreeNode root) {
rec(root);
return max;
}
public int rec(TreeNode root){
if(root == null){
return 0;
}
int leftSubtreeMaxSum = rec(root.left); // 左子树的最大和
int rightSubtreeMaxSum = rec(root.right); // 右子树的最大和
int arch = leftSubtreeMaxSum + root.val + rightSubtreeMaxSum;
int maxPathAcrossRootToParent = Math.max(root.val, Math.max(leftSubtreeMaxSum, rightSubtreeMaxSum)+root.val);
max = Math.max(max, Math.max(arch, maxPathAcrossRootToParent));
return maxPathAcrossRootToParent;
}
}
成绩:
2ms,23.37%,2ms,76.33%
cmershen的碎碎念:
算法实现起来很简单,但有点不易想到。本题还是二叉树递归性质的一种灵活应用,且感觉很贴近面试题。