-
Notifications
You must be signed in to change notification settings - Fork 0
/
M429_N-aryLevelOrder.java
58 lines (44 loc) · 1.31 KB
/
M429_N-aryLevelOrder.java
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
47
48
49
50
51
52
53
54
55
56
57
58
/*
// Definition for a Node.
class Node {
public int val;
public List<Node> children;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, List<Node> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public List<List<Integer>> levelOrder(Node root) {
List<List<Integer>> result = new ArrayList<List<Integer>>();
if(root==null) return result;
Queue<Node> q = new LinkedList<Node>();
List<Integer> res = new ArrayList<Integer>();
res.add(root.val);
result.add(res);
q.offer(root);
while(!q.isEmpty()){
int level = q.size();
res= new ArrayList<Integer>();
for(int i=0; i<level; ++i){
Node nary = q.poll();
List<Node> child = nary.children;
if(!child.isEmpty())
{
for(Node n: child){
q.offer(n);
res.add(n.val);
}
}
}
if(!res.isEmpty())
result.add(res);
}
return result;
}
}