Leetcode #104 Maximum Depth of Binary Tree

最新推荐文章于 2021-12-01 10:33:50 发布

时光未老丶

最新推荐文章于 2021-12-01 10:33:50 发布

阅读量145

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/qq_32796425/article/details/58106409

版权

leetcode 专栏收录该内容

44 篇文章 0 订阅

订阅专栏

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.

Explain

dfs裸搜，刚转行用python写，写的有点臭，后参考了大牛写的略做改进。。

Code

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right)) if root else 0