104. Maximum Depth of Binary Tree
这道题和leetcode第102题没啥区别，通过对树进行遍历即可。设置一个list集合，每向下一层，就给该层编一个号，将编号放入集合。当层数大于等于list元素个数（总的层数）时，需要新加一个元素到list中，如果不是，继续遍历即可。程序如下： /**
* Definition for a binary tree node.
* public class TreeNode {
* i
相关文章
- 1. 104. Maximum Depth of Binary Tree
- 2. 【LeetCode】104. Maximum Depth of Binary Tree
- 3. leetcode -- 104. Maximum Depth of Binary Tree
- 4. Leetcode 104. Maximum Depth of Binary Tree
- 5. Maximum Depth of Binary Tree Leetcode #104 题解[Python]
- 6. [LeetCode]104 - Maximum Depth of Binary Tree(easy) - python
- 7. Maximum Depth of Binary Tree
- 8. Leetcode 之 Maximum Depth of Binary Tree
- 9. 0104. Maximum Depth of Binary Tree (E)
- 10. leetcode -- Maximum Depth of Binary Tree
- 更多相关文章...
- • XSLT
- • XSLT
- • 算法总结-深度优先算法
- • 为了进字节跳动，我精选了29道Java经典算法题，带详细讲解
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
欢迎关注本站公众号,获取更多信息
相关文章
- 1. 104. Maximum Depth of Binary Tree
- 2. 【LeetCode】104. Maximum Depth of Binary Tree
- 3. leetcode -- 104. Maximum Depth of Binary Tree
- 4. Leetcode 104. Maximum Depth of Binary Tree
- 5. Maximum Depth of Binary Tree Leetcode #104 题解[Python]
- 6. [LeetCode]104 - Maximum Depth of Binary Tree(easy) - python
- 7. Maximum Depth of Binary Tree
- 8. Leetcode 之 Maximum Depth of Binary Tree
- 9. 0104. Maximum Depth of Binary Tree (E)
- 10. leetcode -- Maximum Depth of Binary Tree