[leetcode] 543. Diameter of Binary Tree @ python

原题

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

Example:
Given a binary tree
1
/
2 3
/ \
4 5
Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3].

Note: The length of path between two nodes is represented by the number of edges between them.

解法

递归, 由于要求最长的路径, 我们想到了求树的深度, 因此定义depth函数, 遍历二叉树, 在每个节点计算它的左子树和右子树的深度, 同时更新self.ans, 观察左右子树的深度可得知, 路径是当前节点左右子树的深度的和, 且self.ans只会增加不会减少. 我们一次递归便能找到结果.
Time: O(n), n为节点数
Space: O(1)

代码

# 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 diameterOfBinaryTree(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        self.ans = 0
        def depth(root):
            if not root:
                return 0
            left = depth(root.left)
            right = depth(root.right)
            self.ans = max(self.ans, left + right)
            return max(left, right) + 1
        
        depth(root)
        return self.ans