-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathP_133.java
More file actions
44 lines (39 loc) · 1.19 KB
/
Copy pathP_133.java
File metadata and controls
44 lines (39 loc) · 1.19 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
package leetcode.medium;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
@SuppressWarnings("ConstantConditions")
public class P_133 {
private static class Node {
public int val;
public List<Node> neighbors = new ArrayList<>();
Node(int val) {
this.val = val;
}
}
public Node cloneGraph(Node node) {
final Map<Node, Node> clone = new HashMap<>();
final boolean[] seen = new boolean[101];
final Deque<Node> q = new ArrayDeque<>();
if (node != null) {
q.offerLast(node);
seen[node.val] = true;
clone.put(node, new Node(node.val));
}
while (!q.isEmpty()) {
final Node curr = q.removeFirst();
for (Node next : curr.neighbors) {
if (!seen[next.val]) {
seen[next.val] = true;
clone.put(next, new Node(next.val));
q.offerLast(next);
}
clone.get(curr).neighbors.add(clone.get(next));
}
}
return clone.get(node);
}
}