https://leetcode.com/problems/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
解题思路:要求的其实就是“一笔画”能通过的路径中,数值和最大的那一条。那么对每个节点而言,都可以求得以它作为顶点的最大和路径,然后每到一个点都update一下最大值即可。
如下图所示(节点上的数字是标号,不代表值),当6、7号节点为负数时,橙色线为一条以2为顶点的可能的最大路径。也可以注意到,最大路径不必以叶节点作为起止节点,也不一定经过根结点。
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def maxPathSum(self, root):
"""
:type root: TreeNode
:rtype: int
"""
self.max = float('-inf')
self.helper(root)
return self.max
def helper(self,root):
if not root:
return 0
left = max(0, self.helper(root.left)) # 注意取下界为0,表示如果值为负数,那可以不取
right = max(0, self.helper(root.right))
self.max = max(self.max, root.val+left+right) # 第二项表示以当前root作为“最高”点的最大路径
return root.val + max(left,right) # 返回“半条”路径,以供往上一层的节点作为root时求最大值时用。(这个值被赋值给left/right,它的用处可想而知)