您當(dāng)前位置：首頁(yè) > php開(kāi)源 > php教程 > 【LeetCode從零單排】No104 Maximum Depth of Binary Tree

【LeetCode從零單排】No104 Maximum Depth of Binary Tree

來(lái)源：程序員人生發(fā)布時(shí)間：2015-03-17 08:51:03 閱讀次數(shù)：3004次

題目

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()⑴;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⑴) ; return; } getDepth(root.left,height+1); getDepth(root.right,height+1); } }

代碼下載：https://github.com/jimenbian/GarvinLeetCode

/********************************

* 本文來(lái)自博客 “李博Garvin“

* 轉(zhuǎn)載請(qǐng)標(biāo)明出處:http://blog.csdn.net/buptgshengod

******************************************/

生活不易，碼農(nóng)辛苦
如果您覺(jué)得本網(wǎng)站對(duì)您的學(xué)習(xí)有所幫助,可以手機(jī)掃描二維碼進(jìn)行捐贈(zèng)
程序員人生