【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]