点击查看剑指Offer全解【Java & Golang】实现
题目描述
从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
思路
正常的bfs,但是需要注意的是每次需要将当前层的结果都放入一个集合中,而当前队列容量即为当前层的遍历结果。
Java实现
import java.util.ArrayList;
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.LinkedList;
import java.util.ArrayList;
public class Solution {
ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
ArrayList<ArrayList<Integer>> res = new ArrayList<>();
if (pRoot == null) {
return res;
}
LinkedList<TreeNode> queue = new LinkedList<>();
queue.offer(pRoot);
while (!queue.isEmpty()) {
ArrayList<Integer> oneRes = new ArrayList<>();
int size = queue.size();
// 按层存储,需要遍历获取每一层的节点
for (int i = 0; i < size; i++) {
TreeNode poll = queue.poll();
if (poll.left != null) {
queue.offer(poll.left);
}
if (poll.right != null) {
queue.offer(poll.right);
}
oneRes.add(poll.val);
}
res.add(oneRes);
}
return res;
}
}
Golang实现
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
func Print(root *TreeNode) [][]int {
res := make([][]int, 0)
if root == nil {
return res
}
queue := make([]*TreeNode, 0)
queue = append(queue, root)
for len(queue) != 0{
size := len(queue)
oneRes := make([]int, 0)
for i := 0; i < size; i++ {
poll := queue[0]
queue = queue[1:]
if poll.Left != nil {
queue = append(queue, poll.Left)
}
if poll.Right != nil {
queue = append(queue, poll.Right)
}
oneRes = append(oneRes, poll.Val)
}
res = append(res, oneRes)
}
return res
}
1011



被折叠的 条评论
为什么被折叠?



