/
Solution.java
executable file
·91 lines (74 loc) · 2.7 KB
/
Solution.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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
import com.sun.javafx.collections.MappingChange;
import java.util.ConcurrentModificationException;
import java.util.HashMap;
import java.util.LinkedList;
/**
* Definition for undirected graph.
* class UndirectedGraphNode {
* int label;
* List<UndirectedGraphNode> neighbors;
* UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
* };
*/
public class Solution {
public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
if (node == null) return null;
HashMap<UndirectedGraphNode, UndirectedGraphNode> m = new HashMap<>();
UndirectedGraphNode start = new UndirectedGraphNode(node.label);
m.put(node, start);
Deque<UndirectedGraphNode> s = new LinkedList<>();
s.push(node);
while (!s.isEmpty()) {
UndirectedGraphNode current = s.pop();
for (UndirectedGraphNode c : current.neighbors) {
if (!m.containsKey(c)) {
UndirectedGraphNode tmp = new UndirectedGraphNode(c.label);
s.push(c);
m.put(c, tmp);
}
m.get(current).neighbors.add(m.get(c));
}
}
return start;
}
}
/**
* Definition for undirected graph.
* class UndirectedGraphNode {
* int label;
* ArrayList<UndirectedGraphNode> neighbors;
* UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
* };
*/
public class Solution {
public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
if (node == null) return null;
// visit
HashMap<UndirectedGraphNode, UndirectedGraphNode> clone = new HashMap<UndirectedGraphNode, UndirectedGraphNode>();
Deque<UndirectedGraphNode> queue = new LinkedList<UndirectedGraphNode>();
queue.add(node);
while (queue.size() > 0) {
UndirectedGraphNode n = queue.poll();
if (!clone.containsKey(n)) {
clone.put(n, new UndirectedGraphNode(n.label));
for (UndirectedGraphNode neighbor : n.neighbors) {
queue.add(neighbor);
}
}
}
queue.add(node);
HashSet<UndirectedGraphNode> visit = new HashSet<UndirectedGraphNode>();
while (queue.size() > 0) {
UndirectedGraphNode n = queue.poll();
if (!visit.contains(n)) {
visit.add(n);
UndirectedGraphNode c = clone.get(n);
for (UndirectedGraphNode neighbor : n.neighbors) {
c.neighbors.add(clone.get(neighbor));
queue.add(neighbor);
}
}
}
return clone.get(node);
}
}