友情支持
如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜
|
|
有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。
公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。 如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。 |
124. Binary Tree Maximum Path Sum
Given a non-empty 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 must contain at least one node and does not need to go through the root.
Example 1:
Input: [1,2,3]
1
/ \
2 3
Output: 6
Example 2:
Input: [-10,9,20,null,null,15,7]
-10
/ \
9 20
/ \
15 7
Output: 42
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
private int result = Integer.MIN_VALUE;
public int maxPathSum(TreeNode root) {
suforder(root);
return result;
}
private int suforder(TreeNode root) {
if (Objects.isNull(root)) {
return 0;
}
int right = Math.max(0, suforder(root.right));
int left = Math.max(0, suforder(root.left));
result = Math.max(result, left + root.val + right);
return Math.max(left, right) + root.val;
}