【Leetcode】【python】Maximum Depth of Binary Tree
来源:互联网 发布:电子印章生成器软件 编辑:程序博客网 时间:2024/06/06 09:06
题目大意
求二叉树最大深度
解题思路
递归
代码
递归
def maxDepth(self, root): if root == None: return 0 return max(self.maxDepth(root.left),self.maxDepth(root.right))+1
递归(沿用修改前两题代码)
class Solution(object): level_true = 0 def preorder(self, root, level, level_true): if root: if level_true < level+1: print(level_true) self.level_true += 1 self.preorder(root.left, level+1, self.level_true) self.preorder(root.right, level+1, self.level_true) def maxDepth(self, root): self.preorder(root, 0, self.level_true) return self.level_true
总结
- 第一个代码max()+1是累加的重要因素。
- 第二个代码中,self.要好好用。
阅读全文
0 0
- leetcode-Maximum Depth of Binary Tree-python
- 【Leetcode】【python】Maximum Depth of Binary Tree
- Leetcode - Tree - Maximum Depth of Binary Tree
- [leetcode][tree] Maximum Depth of Binary Tree
- 【LeetCode with Python】 Maximum Depth of Binary Tree
- 【LeetCode】【Python题解】Single Number & Maximum Depth of Binary Tree
- [LeetCode] Maximum Depth Of Binary Tree Python 题解
- [leetcode: Python]104. 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
- android.view.WindowLeaked 问题彻底解决【dialog导致窗口泄露】
- 20170722memo
- 设计模式-观察者模式(Java实现)
- 一个完美的鲁棒的数字打印程序
- HTML+CSS编写静态网站-43 如何修复bug
- 【Leetcode】【python】Maximum Depth of Binary Tree
- Oracle12C--重载包中的子程序(五十)
- Oracle12C--包的纯度级别(五十一)
- HTTP详解--HTTP首部(八)
- HTTP详解--通用首部字段解析(九)
- 模拟斗地主,洗牌、发牌、看牌。牌没有顺序. 简单操作.
- 安卓端车牌识别appSDK
- C++中map的使用和基本操作
- Ajax技术--load()显示当前时间