124. Binary Tree Maximum Path Sum

max_gain(特定节点)=节点.val + 子树中较大的值(一个子树)，表示包含该节点在内的最大值

但是整棵树的最大值可能并不包括根结点在内，所以需要检查是继续当前路径还是更改新路径，新路径需要检查node.val + left + right来决定是否更新

# 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_v = float('-inf')
        self.max_gain(root)
        return self.max_v
    def max_gain(self, node):
        if not node:return 0
        left_v = max(self.max_gain(node.left), 0)
        right_v = max(self.max_gain(node.right), 0)
        new_path = node.val + left_v + right_v
        self.max_v = max(self.max_v, new_path)
        return node.val + max(left_v, right_v)