-
Notifications
You must be signed in to change notification settings - Fork 0
/
leetcode133.java
34 lines (32 loc) · 1.01 KB
/
leetcode133.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
/**
* Definition for undirected graph.
* class UndirectedGraphNode {
* int label;
* List<UndirectedGraphNode> neighbors;
* UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
* };
*/
/*
Solution: DFS
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<>();
return DFS(node,map);
}
private UndirectedGraphNode DFS(UndirectedGraphNode node, Map<UndirectedGraphNode,UndirectedGraphNode> map){
if(map.containsKey(node)){
return map.get(node);
}
UndirectedGraphNode copyNode = new UndirectedGraphNode(node.label);
map.put(node, copyNode);
for(UndirectedGraphNode neighbor : node.neighbors){
copyNode.neighbors.add(DFS(neighbor, map)); // recursive
}
return copyNode;
}
}