二叉树中的最大路径和-二叉树124-python

python

# 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
import sys

class Solution:
    def __init__(self):
        self.res = -sys.maxsize
    
    def maxPathSum(self, root: TreeNode):

        def dfs(root):
            if not root:
                return 0
            
            left = dfs(root.left)
            right = dfs(root.right)

            a = root.val
            b = root.val + left
            c = root.val + right
            d = root.val + left + right
            self.res = max(self.res, a, b, c, d)
            
            return max(root.val, root.val+left, root.val+right)
        
        dfs(root)
        
        return self.res