〇、OJ练习
OJ在线编程常见输入输出练习
一、深度优先搜索DFS
class Solution {
public int maxDepth(TreeNode root) {
if(root == null)return 0;
int res = 0;
Queue<TreeNode> queue = new ArrayDeque<>();
queue.add(root);
while(!queue.isEmpty()){
int size = queue.size();
for(int i = 0; i < size;i++){
TreeNode node = queue.poll();
if(node.left!=null)queue.add(node.left);
if(node.right!=null)queue.add(node.right);
}
res++;
}
return res;
}
}
class Solution {
public int maxDepth(TreeNode root) {
return root == null?0:Math.max(maxDepth(root.left),maxDepth(root.right)+1);
