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