摘要：
public Node connect(Node root) { Deque<Node> q = new LinkedList(); if(root == null) return root; q.offer(root); while(!q.isEmpty()) { int size = q.siz 阅读全文
posted @ 2022-02-19 23:34
明卿册
阅读(24)
评论(0)
推荐(0)
摘要：
public int maxDepth(TreeNode root) { int ans = 0; if(root == null) return 0; Deque<TreeNode> q = new LinkedList(); q.offer(root); while(!q.isEmpty()) 阅读全文
posted @ 2022-02-19 23:25
明卿册
阅读(25)
评论(0)
推荐(0)
浙公网安备 33010602011771号