呓语Beta 2.0 首页 镜头后 灶台前 捐赠者名单 有趣的小站

leetcode 543 Diameter Of Binary Tree

文档信息

leetcode 543 Diameter Of Binary Tree

解法一

# 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.best = 1
        def depth(root):
            if not root: return 0
            left = depth(root.left)
            right = depth(root.right)
            self.best = max(self.best, left+right+1)
            return max(left, right) + 1
        depth(root)
        return self.best-1

note

捐赠支持

可以使用支付宝转帐给richard.ma.19850509#gmail.com(请将#替换为@),谢谢!

Fork me on GitHub