題目：
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 a binary tree node.* public class TreeNode {* int val;* TreeNode left;* TreeNode right;* TreeNode(int x) { val = x; }* }*/ public class Solution {public int maxDepth(TreeNode root) {if(root==null){return 0;}int leftnum=0;if(root.left!=null){leftnum=maxDepth(root.left);}int rightnum=0;if(root.right!=null){rightnum=maxDepth(root.right);}if(leftnum>rightnum){return leftnum+1;}else{return rightnum+1;}} }

總結

以上是生活随笔為你收集整理的Leet Code OJ 104. Maximum Depth of Binary Tree [Difficulty: Easy]的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。