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.
2 parents 4d3f3f7 + 8b9f4da commit 7ae3d84Copy full SHA for 7ae3d84
java/261-Graph-Valid-Tree.java
@@ -18,7 +18,7 @@ public boolean validTree(int n, int[][] edges) {
18
19
Set<Integer> visited = new HashSet<>();
20
21
- return depthFirstSearch(0, -1, visited) && visited.size() == n;
+ return depthFirstSearch(edges[0][0], -1, visited) && visited.size() == n;
22
}
23
24
private boolean depthFirstSearch(
0 commit comments