【Leetcode】111. Minimum Depth of Binary Tree 解题报告
求树的最小深度，深度为根节点到叶子节点的长度 方法1 递归 对于某个非None节点我们返回其左右子树最小的深度，但是要注意返回的值是否为0，如果为0，其最小深度就是另外一个子树的深度 class Solution:
def minDepth(self, root):
""" :type root: TreeNode :rtype: int """
if ro
相关文章
- 1. [LeetCode]111.Minimum Depth of Binary Tree
- 2. LeetCode 111 Minimum Depth of Binary Tree
- 3. 111.minimum depth of binary tree
- 4. LeetCode 111. Minimum Depth of Binary
- 5. 111. Minimum Depth of Binary Tree
- 6. 【leetcode】Minimum Depth of Binary Tree
- 7. leetcode, LC1: Minimum Depth of Binary Tree
- 8. LeetCode.3.minimum-depth-of-binary-tree
- 9. LeetCode - Minimum Depth of Binary Tree
- 10. Minimum Depth of Binary Tree [LeetCode]
- 更多相关文章...
- • ARP报文格式详解 - TCP/IP教程
- • UDP报文格式详解 - TCP/IP教程
- • PHP Ajax 跨域问题最佳解决方案
- • IntelliJ IDEA中SpringBoot properties文件不能自动提示问题解决
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
欢迎关注本站公众号,获取更多信息
相关文章
- 1. [LeetCode]111.Minimum Depth of Binary Tree
- 2. LeetCode 111 Minimum Depth of Binary Tree
- 3. 111.minimum depth of binary tree
- 4. LeetCode 111. Minimum Depth of Binary
- 5. 111. Minimum Depth of Binary Tree
- 6. 【leetcode】Minimum Depth of Binary Tree
- 7. leetcode, LC1: Minimum Depth of Binary Tree
- 8. LeetCode.3.minimum-depth-of-binary-tree
- 9. LeetCode - Minimum Depth of Binary Tree
- 10. Minimum Depth of Binary Tree [LeetCode]