【Leetcode二叉树层序遍历】429. N 叉树的层序遍历(这里有很简洁的N叉树的定义哦)

Leetcode429

1.问题描述

2.解决方案

没什么好说的，就是把每层所有结点，那个类定义中的结点数组都加入队列，其他和层序遍历一样
这个N叉树的定义还蛮简洁的记一下！

for(int j=0;j<cur->children.size();j++) queue.push(cur->children[j]);
ans.push_back(oneLayer);

//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) {
        vector<vector<int>> ans;
        queue<Node*> queue;
        queue.push(root);
        if(root==nullptr) return ans;

        while(queue.empty()== false){
            vector<int> oneLayer;
            int len=queue.size();
            for(int i=0;i<len;i++){
                Node* cur=queue.front();
                queue.pop();
                oneLayer.push_back(cur->val);

                //if(cur->left!= nullptr) queue.push(cur->left);
                //if(cur->right!= nullptr) queue.push(cur->right);
                for(int j=0;j<cur->children.size();j++) queue.push(cur->children[j]);
            }
            ans.push_back(oneLayer);
        }
        return ans;
    }
};