LeetCode Solutions
class Solution {
public:
bool canVisitAllRooms(vector<vector<int>>& rooms) {
vector<bool> seen(rooms.size());
dfs(rooms, 0, seen);
return all_of(begin(seen), end(seen), [](int s) { return s == true; });
}
private:
void dfs(const vector<vector<int>>& rooms, int node, vector<bool>& seen) {
seen[node] = true;
for (const int child : rooms[node])
if (!seen[child])
dfs(rooms, child, seen);
}
};
|
class Solution {
public boolean canVisitAllRooms(List<List<Integer>> rooms) {
int[] seen = new int[rooms.size()];
dfs(rooms, 0, seen);
return Arrays.stream(seen).allMatch(a -> a == 1);
}
private void dfs(List<List<Integer>> rooms, int node, int[] seen) {
seen[node] = 1;
for (final int child : rooms.get(node))
if (seen[child] == 0)
dfs(rooms, child, seen);
}
}
|
class Solution:
def canVisitAllRooms(self, rooms: List[List[int]]) -> bool:
seen = [False] * len(rooms)
def dfs(node: int) -> None:
seen[node] = True
for child in rooms[node]:
if not seen[child]:
dfs(child)
dfs(0)
return all(seen)
|
