题解 | #二叉树的最大深度#
二叉树的最大深度
http://www.nowcoder.com/practice/8a2b2bf6c19b4f23a9bdb9b233eefa73
class Solution:
def maxDepth(self, root: TreeNode) -> int:
# write code here
if root is None:
return 0
if root.left is None and root.right is None:
return 1
l = self.maxDepth(root.left)
r = self.maxDepth(root.right)
return l+1 if l>r else r+1
查看11道真题和解析