剑指offer六十之按之把二叉树打印成多行

import java.util.ArrayList;
import java.util.LinkedList;

/*
* 队列LinkedList完成层序遍历，用end记录每层结点数目
*/
public class Solution {
    ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
        //保存结果
        ArrayList<ArrayList<Integer>> result = new ArrayList<>();
        //预检验
        if (pRoot == null) {
            return result;
        }
        LinkedList<TreeNode> layer = new LinkedList<>();
        ArrayList<Integer> layerList = new ArrayList<>();

        layer.add(pRoot);

        int start = 0, end = 1;

        while (!layer.isEmpty()) {
            TreeNode cur = layer.remove();
            layerList.add(cur.val);
            start++;
            if (cur.left != null) {
                layer.add(cur.left);
            }
            if (cur.right != null) {
                layer.add(cur.right);
            }
            if (start == end) {
                end = layer.size();
                start = 0;
                result.add(layerList);
                layerList = new ArrayList<>();
            }
        }
        return result;
    }
}