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

leetcode 111 Minimum Depth Of Binary Tree

文档信息

leetcode 111 Minimum Depth 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 minDepth(self, root, level=1):
        """
        :type root: TreeNode
        :rtype: int
        """
        if not root:
            return 0
        elif not root.left and not root.right:
            return level
        elif root.left and root.right:
            return min(self.minDepth(root.left, level+1), self.minDepth(root.right, level+1))
        elif root.left and not root.right:
            return self.minDepth(root.left, level+1)
        elif root.right and not root.left:
            return self.minDepth(root.right, level+1)

note

捐赠支持

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

Fork me on GitHub