leetcode 1026

此题是想找到根节点和子节点的最大差值。关键是要找到子结构。可以发现最大差值是由每个子树的最大值和最小值决定的。因此我们新建一个函数，返回最大差值以及最大值最小值。当返回更上一层时，我们就可以更新这些值，并且根据最大最小值重新计算最大差值。

代码如下：

# 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 tempDiff(self, root):
        if root.left == None and root.right == None:
            return 0, root.val, root.val
        if root.right == None:
            left_diff, left_max, left_min = self.tempDiff(root.left)
            new_diff = max(abs(root.val -left_max), abs(root.val- left_min))
            if new_diff < left_diff:
                new_diff = left_diff
            new_max = root.val
            new_min = root.val
            if new_max < left_max:
                new_max = left_max
            if new_min > left_min:
                new_min = left_min
            return new_diff, new_max, new_min
        if root.left == None:
            right_diff, right_max, right_min = self.tempDiff(root.right)
            new_diff = max(abs(root.val -right_max), abs(root.val- right_min))
            if new_diff < right_diff:
                new_diff = right_diff
            new_max = root.val
            new_min = root.val
            if new_max < right_max:
                new_max = right_max
            if new_min > right_min:
                new_min = right_min
            return new_diff, new_max, new_min
        more_diff, more_max, more_min = self.tempDiff(root.left)
        right_diff, right_max, right_min = self.tempDiff(root.right)
        if right_diff > more_diff:
            more_diff = right_diff
        if right_max > more_max:
            more_max = right_max
        if more_min > right_min:
            more_min = right_min
        new_diff = max(abs(root.val -more_max), abs(root.val- more_min))
        if new_diff < more_diff:
            new_diff = more_diff
        new_max = root.val
        new_min = root.val
        if new_max < more_max:
            new_max = more_max
        if new_min > more_min:
            new_min = more_min
        return new_diff, new_max, new_min
    def maxAncestorDiff(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if root == None:
            return 0
        result, _,_ = self.tempDiff(root)
        return result