-
Notifications
You must be signed in to change notification settings - Fork 2
/
CloneGraph.java
45 lines (37 loc) · 1.14 KB
/
CloneGraph.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
/*
// Definition for a Node.
class Node {
public int val;
public List<Node> neighbors;
public Node() {}
public Node(int _val,List<Node> _neighbors) {
val = _val;
neighbors = _neighbors;
}
};
*/
class Solution {
public Node cloneGraph(Node node) {
Map<Node, Node> map = new HashMap<>();
Queue<Node> queue = new LinkedList<>();
queue.offer(node);
while (!queue.isEmpty()) {
Node topNode = queue.poll();
if (!map.containsKey(topNode)) {
Node copy = new Node(topNode.val, new ArrayList<>());
map.put(topNode, copy);
}
Node copy = map.get(topNode);
List<Node> neighbors = topNode.neighbors;
for (Node n : neighbors) {
if (!map.containsKey(n)) {
Node c = new Node(n.val, new ArrayList<>());
map.put(n, c);
queue.offer(n);
}
copy.neighbors.add(map.get(n));
}
}
return map.get(node);
}
}