LeetCode 133 Clone Graph

Posted on   |  

Question

[LeetCode 133] Clone an undirected graph.

Submission

Java Submission
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
/**
 * Definition for undirected graph.
 * class UndirectedGraphNode {
 *     int label;
 *     List<UndirectedGraphNode> neighbors;
 *     UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
 * };
 */
public class Solution {
    public Map<Integer, UndirectedGraphNode> nodes = new HashMap<Integer, UndirectedGraphNode>();

    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        if (node == null) {
            return null;
        }

        if (nodes.containsKey(node.label)) {
            return nodes.get(node.label);
        }

        UndirectedGraphNode cloneNode = new UndirectedGraphNode(node.label);
        nodes.put(node.label, cloneNode);

        for (UndirectedGraphNode neigblor: node.neighbors) {
            UndirectedGraphNode cloneNeigblor = cloneGraph(neigblor);
            cloneNode.neighbors.add(cloneNeigblor);
        }

        return cloneNode;
    }
}