java
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode() {}
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
Queue<TreeNode> queue=new LinkedList<>();
List<List<Integer>> result=new ArrayList<>();
TreeNode tmp;
TreeNode flag=new TreeNode(0);
List<Integer> list=new ArrayList<>();
if (root==null) return result;
queue.add(root);
queue.add(flag);
while (queue.peek()!=null){
tmp = queue.poll();
if (tmp==flag){
result.add(list);
list.clear();
if (queue.peek()!=null){
queue.add(flag);
}
continue;
}
list.add(tmp.val);
if (tmp.left!=null){
queue.add(tmp.left);
}
if (tmp.right!=null){
queue.add(tmp.right);
}
}
return result;
}
}
在解决"二叉树的层序遍历"时,写了以上代码
有一个样例是
java
输入:root = [3,9,20,null,null,15,7]
输出:[[3],[9,20],[15,7]]
而代码执行结果是
java
输入:root = [3,9,20,null,null,15,7]
输出:[[],[],[]]
找到问题:
result里面每个list都是同一个对象,对应同一块内存空间,最终list被清空了,所以导致这样的结果
解决:
java
result.add(new ArrayList<>(list));