【LeetCode從零單排】No104 Maximum Depth of Binary Tree
題目
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.
程式碼
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
List<Integer> deep_list=new ArrayList<Integer>();
public int maxDepth(TreeNode root) {
if(root==null) return 0;
getDepth(root,1);
int max=1;
for(int i=0;i<deep_list.size()-1;i++){
if(deep_list.get(i)>max){
max=deep_list.get(i);
}
}
return max;
}
public void getDepth(TreeNode root,int height){
if(root==null)
{
deep_list.add(height-1) ;
return;
}
getDepth(root.left,height+1);
getDepth(root.right,height+1);
}
}
/********************************
* 本文來自部落格 “李博Garvin“
* 轉載請標明出處:http://blog.csdn.net/buptgshengod
******************************************/
相關文章
- Leetcode Maximum Depth of Binary TreeLeetCode
- [leetcode]maximum-depth-of-binary-treeLeetCode
- Leetcode-Maximum Depth of Binary TreeLeetCode
- Maximum Depth of Binary Tree leetcode javaLeetCodeJava
- LeetCode 104. Maximum Depth of Binary TreeLeetCode
- 104. Maximum Depth of Binary Tree--LeetCode RecordLeetCode
- 104. Maximum Depth of Binary Tree(圖解)圖解
- Maximum Depth of Binary Tree 二叉樹的深度二叉樹
- 【LeetCode從零單排】No 114 Flatten Binary Tree to Linked ListLeetCode
- 【LeetCode 104_二叉樹_遍歷】Maximum Depth of Binary TreeLeetCode二叉樹
- Leetcode Minimum Depth of Binary TreeLeetCode
- 【LeetCode從零單排】No102 Binary Tree Level Order TraversalLeetCode
- Leetcode-Minimum Depth of Binary TreeLeetCode
- Minimum Depth of Binary Tree leetcode javaLeetCodeJava
- Leetcode Binary Tree Maximum Path SumLeetCode
- LeetCode のminimum-depth-of-binary-treeLeetCode
- Binary Tree Maximum Path Sum leetcode javaLeetCodeJava
- 【LeetCode從零單排】No96 Unique Binary Search TreesLeetCode
- leetcode-124-Binary Tree Maximum Path SumLeetCode
- LeetCode 124. Binary Tree Maximum Path SumLeetCode
- 【LeetCode從零單排】No100 Same Tree && No101 Symmetric TreeLeetCode
- 【LeetCode從零單排】No38.CountAndSayLeetCode
- 【LeetCode從零單排】No.7 Reverse IntegerLeetCode
- 【LeetCode從零單排】No20.ValidParenthesesLeetCode
- 【LeetCode從零單排】No19.RemoveNthNodeFromEndofListLeetCodeREM
- 【LeetCode從零單排】No21.MergeTwoSortedListsLeetCode
- 【LeetCode從零單排】No27.Remove ElementLeetCodeREM
- 【LeetCode從零單排】No28 Implement strStr()LeetCode
- 【LeetCode從零單排】No22.Generate ParenthesesLeetCode
- 【LeetCode 111_二叉樹_遍歷】Minimum Depth of Binary TreeLeetCode二叉樹
- Leetcode Binary Tree PathsLeetCode
- LeetCode Invert Binary TreeLeetCode
- Leetcode Balanced Binary TreeLeetCode
- 【LeetCode從零單排】No58.Length of Last WordLeetCodeAST
- 【LeetCode從零單排】No67.AddBinaryLeetCode
- 【LeetCode從零單排】No70.ClimbingStairsLeetCodeAI
- 【LeetCode從零單排】No.9 Palindrome NumberLeetCode
- 【LeetCode從零單排】No14.LongestCommonPrefixLeetCode