leetcode 429.N叉树的层序遍历

/*
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val) {
        val = _val;
    }

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
public:
    vector<vector<int>> levelOrder(Node* root) {
        queue<Node*> q;
        if(root!=NULL) q.push(root);
        vector<vector<int>> res;
        vector<Node*> curN;
        while(!q.empty()){
            vector<int> vec;
            int size=q.size();
            for(int i=0;i<size;i++){
                Node* cur=q.front();
                q.pop();
                vec.push_back(cur->val);
                curN=cur->children;

                for(int j=0;j<curN.size();j++){
                    q.push(curN[j]);
                }



            }
            res.push_back(vec); 
        }
        return res;

    }
};