二叉树的深度(简单)
2020年9月9日
题目来源:力扣
解题
每进一层就加一
- 详细写法
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
private int max;
public int maxDepth(TreeNode root) {
dfs(root,1);
return max;
}
private void dfs(TreeNode root,int cur){
if(root==null) return;
dfs(root.left,cur+1);
dfs(root.right,cur+1);
max=Math.max(max,cur);
}
}
- 简洁写法
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int maxDepth(TreeNode root) {
if(root==null) return 0;
return Math.max(maxDepth(root.left),maxDepth(root.right))+1;
}
}