leetcode:Minimum Depth of Binary Tree【Python版】
1、类中递归调用添加self;
2、root为None,返回0
3、root不为None,root左右孩子为None,返回1
4、返回l和r最小深度,l和r初始为极大值;
1 # Definition for a binary tree node 2 # class TreeNode: 3 # def __init__(self, x): 4 # self.val = x 5 # self.left = None 6 # self.right = None 7 8 class Solution: 9 # @param root, a tree node 10 # @return an integer 11 def minDepth(self, root): 12 if root == None: 13 return 0 14 if root.left==None and root.right==None: 15 return 1 16 l,r = 9999,9999 17 if root.left!=None: 18 l = self.minDepth(root.left) 19 if root.right!=None: 20 r = self.minDepth(root.right) 21 if l<r: 22 return 1+l 23 return 1+r
![字节跳动内推](https://img2020.cnblogs.com/blog/323808/202004/323808-20200415172728571-1992447742.jpg)
找我内推: 字节跳动各种岗位
作者:
ZH奶酪(张贺)
邮箱:
cheesezh@qq.com
出处:
http://www.cnblogs.com/CheeseZH/
*
本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出原文连接,否则保留追究法律责任的权利。