-
Notifications
You must be signed in to change notification settings - Fork 7
/
Main.java
49 lines (41 loc) · 1.15 KB
/
Main.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
package com.company;
import com.sun.source.tree.Tree;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
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;
}
}
public class Main {
public static void main(String[] args) {
// write your code here
}
public List<List<Integer>> levelOrder(Node root) {
List<List<Integer>> res = new ArrayList<>();
if(root == null) return res;
ArrayDeque<Node> queue = new ArrayDeque<>(){{offer(root);}};
while (!queue.isEmpty()){
int count = queue.size();
List<Integer> temp = new ArrayList<>();
for (int i = 0; i < count; i++) {
Node cur = queue.poll();
temp.add(cur.val);
for (Node child : cur.children){
if(child != null)
queue.offer(child);
}
}
res.add(temp);
}
return res;
}
}