-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBoardFirstSearch.java
More file actions
51 lines (42 loc) · 1.17 KB
/
BoardFirstSearch.java
File metadata and controls
51 lines (42 loc) · 1.17 KB
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
package com.leetcode.stack;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
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 BoardFirstSearch {
public List<List<Integer>> levelOrder(Node root) {
List<List<Integer>> lists = new ArrayList<>();
List<Integer> nodes = null;
LinkedList<Node> queue = new LinkedList<>();
if(root!=null){
queue.addFirst(root);
nodes = new ArrayList<>();
nodes.add(root.val);
lists.add(nodes);
}
while (!queue.isEmpty()){
Node node = queue.pollFirst();
if(node.children!=null&&node.children.size()>1){
nodes = new ArrayList<>();
for(Node n:node.children){
queue.addLast(n);
nodes.add(n.val);
}
lists.add(nodes);
}
}
return lists;
}
}