题目链接
递归
class Solution {
public int maxDepth(TreeNode root) {
if(root==null) return 0;
//左子树递归
int left = maxDepth(root.left);
//右子树递归
int right = maxDepth(root.right);
//递归返回时,递归的越深,返回的数值越大
return Math.max(left,right) + 1;
}
}
我部生产代码,我只是代码的搬运工
class Solution {
public int maxDepth(TreeNode root) {
return root==null ? 0:Math.max(maxDepth(root.left),maxDepth(root.right))+1;
}
}