124. Binary Tree Maximum Path Sum

124. Binary Tree Maximum Path Sum

Hard

8891517Add to ListShare

A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root.

The path sum of a path is the sum of the node's values in the path.

Given the root of a binary tree, return the maximum path sum of any non-empty path.

Example 1:

Input: root = [1,2,3]
Output: 6
Explanation: The optimal path is 2 -> 1 -> 3 with a path sum of 2 + 1 + 3 = 6.

Example 2:

Input: root = [-10,9,20,null,null,15,7]
Output: 42
Explanation: The optimal path is 15 -> 20 -> 7 with a path sum of 15 + 20 + 7 = 42.

Constraints:

• The number of nodes in the tree is in the range [1, 3 * 104].
• -1000 <= Node.val <= 1000

Accepted

697,393

Submissions

1,859,701

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def maxPathSum(self, root: Optional[TreeNode]) -> int:
        
        self.ans=-float("inf")
        
        def dfs(node):
            if not node:return [0,0]
            l1,r1=dfs(node.left)
            l2,r2=dfs(node.right)
            l,r=max(l1,r1,0)+node.val,max(l2,r2,0)+node.val
            self.ans=max(self.ans,l+r-node.val)
            return [l,r]
    
        dfs(root)
        return self.ans
        

l,r 已经包含了根节点的值