[Lintcode]97. Maximum Depth of Binary Tree/[Leetcode]104. Maximum Depth of Binary Tree

Posted siriusli

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[Lintcode]97. Maximum Depth of Binary Tree/[Leetcode]104. Maximum Depth of Binary Tree相关的知识,希望对你有一定的参考价值。

97. Maximum Depth of Binary Tree/104. Maximum Depth of Binary Tree

  • 本题难度: Easy
  • Topic: Binary Tree

Description

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Example
Example 1:
Input: tree = {}
Output: 0

Explanation:
The height of empty tree is 0.

Example 2:
Input: tree = {1,2,3,#,#,4,5}
Output: 3

Explanation:
Like this:
      1  
     /                 
    2  3                
      /                  
     4   5 

我的代码

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""

class Solution:
    """
    @param root: The root of binary tree.
    @return: An integer
    """
    def maxDepth(self, root):
        # write your code here
        return 1+max(self.maxDepth(root.left),self.maxDepth(root.right)) if root else 0

别人的代码

def maxDepth(self, root):
    return 1 + max(map(self.maxDepth, (root.left, root.right))) if root else 0

思路
递归

  • 出错
    记得加self







以上是关于[Lintcode]97. Maximum Depth of Binary Tree/[Leetcode]104. Maximum Depth of Binary Tree的主要内容,如果未能解决你的问题,请参考以下文章

LintCode: Maximum Depth of Binary Tree

lintcode-medium-Maximum Subarray II

lintcode-easy-Maximum Depth of Binary Tree

[LintCode] Maximum Subarray 最大子数组

[LintCode] Maximum Gap 求最大间距

lintcode-medium-Binary Tree Maximum Path Sum