LeetCode 104
2020.8.13
我的通过代码
/**
* 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) {
List<Integer> list = new ArrayList<Integer>();
if(root==null) return 0;
else {
traverse(root,list,1);
int x = list.get(0);
for(int i=1;i<list.size();i++) {
if(x<list.get(i)) x = list.get(i);
}
return x;
}
}
void traverse(TreeNode root,List<Integer> list,int i) {
if(root==null) return;
list.add(i);
i++;
traverse(root.left,list,i);
traverse(root.right,list,i);
}
}
官方题解
/**
* 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;
else {
return 1+Math.max(maxDepth(root.left),maxDepth(root.right));
}
}
}