We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent d2d6054 commit c61d74cCopy full SHA for c61d74c
clone-graph/forest000014.java
@@ -42,7 +42,7 @@ public Node cloneGraph(Node node) {
42
}
43
44
Node newNode = createNode(node.val);
45
- dfs(node, newNode);
+ dfs(node);
46
47
return newNode;
48
@@ -54,7 +54,9 @@ public Node createNode(int val) {
54
return map.get(val);
55
56
57
- public void dfs(Node oldNode, Node newNode) {
+ public void dfs(Node oldNode) {
58
+ Node newNode = map.get(oldNode.val);
59
+
60
for (Node oldNeighbor : oldNode.neighbors) {
61
boolean hasIt = false;
62
for (Node newNeighbor : newNode.neighbors) {
0 commit comments