剑指Offer-60.把二叉树打印成多行(C++/Java)

class Solution {
public:
    vector<vector<int> > Print(TreeNode* pRoot) {
        if(pRoot == nullptr)
            return res;
        vector<TreeNode*> printS;
        vector<TreeNode*> temp;
        printS.push_back(pRoot);
        while(!printS.empty()){
            //vector<TreeNode*> temp;
            vector<int> resTemp;
            for(auto i:printS){
                if(i->left != nullptr)
                    temp.push_back(i->left);
                if(i->right != nullptr)
                    temp.push_back(i->right);
            }
            for(int i = 0; i < printS.size(); ++i)
                resTemp.push_back(printS[i]->val);
            res.push_back(resTemp);
            printS.swap(temp);
            temp.clear();
        }
        return res;
    }
private:
    vector<vector<int>> res;
};

import java.util.ArrayList;


/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
        if(pRoot == null)
            return res;
        ArrayList<TreeNode> printS = new ArrayList<>();
        ArrayList<TreeNode> temp = new ArrayList<>();
        printS.add(pRoot);
        while(!printS.isEmpty()){
            ArrayList<Integer> resTemp = new ArrayList<>();
            for(TreeNode i:printS){
                if(i.left != null)
                    temp.add(i.left);
                if(i.right != null)
                    temp.add(i.right);
            }
            for(int i = 0; i < printS.size(); ++i)
                resTemp.add(printS.get(i).val);
            res.add(resTemp);
            printS.clear();
            printS.addAll(temp);
            temp.clear();
            resTemp = null;
        }
        return res;
    }
    private ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
}