-
Notifications
You must be signed in to change notification settings - Fork 1
/
133. Clone Graph
41 lines (39 loc) · 979 Bytes
/
133. Clone Graph
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
/*
// Definition for a Node.
class Node {
public int val;
public List<Node> neighbors;
public Node() {
val = 0;
neighbors = new ArrayList<Node>();
}
public Node(int _val) {
val = _val;
neighbors = new ArrayList<Node>();
}
public Node(int _val, ArrayList<Node> _neighbors) {
val = _val;
neighbors = _neighbors;
}
}
*/
class Solution {
HashMap<Node, Node> visited = new HashMap<>();
public Node cloneGraph(Node node)
{
if(node == null)
return null;
if(visited.containsKey(node))
return visited.get(node);
Node res = new Node(node.val);
ArrayList cloneNeighbors = new ArrayList<>();
res.neighbors = cloneNeighbors;
visited.put(node, res);
for(Node nei:node.neighbors)
{
Node cloneNode = cloneGraph(nei);
cloneNeighbors.add(cloneNode);
}
return res;
}
}