(Node node)
| 21 | |
| 22 | class Solution { |
| 23 | public Node cloneGraph(Node node) { |
| 24 | if (node == null) return null; |
| 25 | |
| 26 | Map<Node, Node> visited = new HashMap<>(); |
| 27 | return dfs(node, visited); |
| 28 | } |
| 29 | |
| 30 | private Node dfs(Node node, Map<Node, Node> visited) { |
| 31 | if (visited.containsKey(node)) return visited.get(node); |