-
Notifications
You must be signed in to change notification settings - Fork 1
/
429+levelOrder.cpp
46 lines (41 loc) · 1.05 KB
/
429+levelOrder.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
/*
// 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>> res;
queue<Node*> que;
if (root != NULL) que.push(root);
while (!que.empty()) {
vector<int> vec;
int size = que.size();
for (int i = 0; i < size; ++i) {
Node* node = que.front();
que.pop();
vec.push_back(node->val);
if (!node->children.empty()) {
int vsize = node->children.size();
for (int j = 0; j < vsize; ++j) {
que.push(node->children[j]);
}
}
}
res.push_back(vec);
}
return res;
}
};