-
Notifications
You must be signed in to change notification settings - Fork 0
/
leetcode133v2.java
40 lines (40 loc) · 1.33 KB
/
leetcode133v2.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
/**
* Definition for undirected graph.
* class UndirectedGraphNode {
* int label;
* List<UndirectedGraphNode> neighbors;
* UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
* };
*/
/*
Solution: BFS
Time: O(n)
Space: O(n)
*/
public class Solution {
public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
if(node == null)
return null;
Map<UndirectedGraphNode, UndirectedGraphNode> map = new HashMap<>();
Queue<UndirectedGraphNode> q = new LinkedList<>();
q.add(node);
UndirectedGraphNode copyNode = new UndirectedGraphNode(node.label);
map.put(node, copyNode);
while(!q.isEmpty()){
UndirectedGraphNode tmp = q.poll();
for(UndirectedGraphNode neighbor : tmp.neighbors){
if(map.containsKey(neighbor)){
map.get(tmp).neighbors.add(map.get(neighbor));
}
else{
// create a new copy of neigbor
UndirectedGraphNode neighborCopy = new UndirectedGraphNode(neighbor.label);
map.get(tmp).neighbors.add(neighborCopy);
map.put(neighbor, neighborCopy);
q.add(neighbor);
}
}
}
return copyNode;
}
}