LeetCode Maximum Depth of Binary Tree
来源:互联网 发布:pdf压缩软件 for mac 编辑:程序博客网 时间:2024/05/16 03:37
LeetCode解题之Maximum Depth of Binary Tree
原题
求一颗二叉树的最大深度,最大深度指跟节点到最底层叶子节点的距离。
注意点:
- 无
例子:
输入:
3 / \ 9 20 / \ 15 7 / 14
输出: 4
解题思路
用递归的方法,当前节点的最大深度就是左节点的最大深度和右节点的最大深度之中取大的加一。
AC源码
# Definition for a binary tree node.class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = Noneclass Solution(object): def maxDepth(self, root): """ :type root: TreeNode :rtype: int """ if not root: return 0 return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1if __name__ == "__main__": None
欢迎查看我的Github (https://github.com/gavinfish/LeetCode-Python) 来获得相关源码。
0 0
- Leetcode - Tree - Maximum Depth of Binary Tree
- [leetcode][tree] Maximum Depth of Binary Tree
- LeetCode Maximum Depth of Binary Tree
- [Leetcode] Maximum Depth of Binary Tree
- leetcode 24: Maximum Depth of Binary Tree
- [LeetCode] Maximum Depth of Binary Tree
- Leetcode 104 Maximum Depth of Binary Tree
- 【leetcode】Maximum Depth of Binary Tree
- [leetcode]Maximum Depth of Binary Tree
- [LeetCode]Maximum Depth of Binary Tree
- [leetcode]Maximum Depth of Binary Tree
- Leetcode: Maximum Depth of Binary Tree
- LeetCode-Maximum Depth of Binary Tree
- [leetcode] Maximum Depth of Binary Tree
- LeetCode - Maximum Depth of Binary Tree
- LeetCode:Maximum Depth of Binary Tree
- LeetCode | Maximum Depth of Binary Tree
- 【leetcode】Maximum Depth of Binary Tree
- CentOS环境下Redis安装
- 什么是mov压敏电阻 保护作用
- 【3】Toasts
- Linux服务器权限管理实践——添加用户只访问某些文件目录
- nRF905 无线发射模块
- LeetCode Maximum Depth of Binary Tree
- https原理:证书传递、验证和数据加密、解密过程解析
- [Leetcode]188. Best Time to Buy and Sell Stock IV@python
- HDU 2066 一个人的旅行 (最短路----floyd && dijkstra)
- Android开发学习之路--UI之基本布局
- 【Java】java使用反射访问对象方法和成员变量
- 应用层数据库读写分离db-loadbalance
- Codeforces 542F 构造
- 第7讲项目1——正差值