LeetCode 124. 二叉树中的最大路径和

题目地址：
https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/

在 codetop.cc 有同学指出

字节跳动后端开发面试中出现过本题，而且在此基础上要求打印出路径来

经多次指正，本文给出参考解答

# 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: TreeNode) -> int:
        self.ans = -1000 # 或者 float("-inf") 
        self.path = [] # 存储路径
        self.dfs(root)
        print(self.path)
        return self.ans
    
    def dfs(self, root): # 返回从该根节点到叶节点最大路径和
        if root is None: return 0, []
        left, leftPath = self.dfs(root.left)
        right, rightPath = self.dfs(root.right)
        
        if root.val + left + right > self.ans:
            self.ans = root.val + left + right
            self.path = leftPath + [root.val] + rightPath

        if left > 0 and left > right:
            res = left + root.val
            path = leftPath + [root.val]
        elif right > 0 and right > left:
            res = right + root.val
            path = [root.val] + rightPath 
        else:
            res = root.val
            path = [root.val]
            
        if self.ans < res: 
            self.ans = res
            self.path = path
            
        return res, path # res 是路径和，path 是路径数组