Formatted question description: https://leetcode.ca/all/841.html

# 841. Keys and Rooms (Medium)

There are N rooms and you start in room 0.  Each room has a distinct number in 0, 1, 2, ..., N-1, and each room may have some keys to access the next room.

Formally, each room i has a list of keys rooms[i], and each key rooms[i][j] is an integer in [0, 1, ..., N-1] where N = rooms.length.  A key rooms[i][j] = v opens the room with number v.

Initially, all the rooms start locked (except for room 0).

You can walk back and forth between rooms freely.

Return true if and only if you can enter every room.

Example 1:

Input: [,,,[]]
Output: true
Explanation:
We start in room 0, and pick up key 1.
We then go to room 1, and pick up key 2.
We then go to room 2, and pick up key 3.
We then go to room 3.  Since we were able to go to every room, we return true.


Example 2:

Input: [[1,3],[3,0,1],,]
Output: false
Explanation: We can't enter the room with number 2.


Note:

1. 1 <= rooms.length <= 1000
2. 0 <= rooms[i].length <= 1000
3. The number of keys in all rooms combined is at most 3000.

Companies:

Related Topics:
Depth-first Search, Graph

## Solution 1.

// OJ: https://leetcode.com/problems/keys-and-rooms/
// Time: O(K) where K is the count of all the keys.
// Space: O(N) where N is the count of rooms
class Solution {
public:
bool canVisitAllRooms(vector<vector<int>>& rooms) {
int N = rooms.size(), cnt = 1;
vector<bool> seen(N, false);
seen = true;
queue<int> q;
q.push(0);
while (q.size()) {
q.push(k);
auto key = q.front();
q.pop();
auto r = rooms[key];
for (int k : r) {
if (!seen[k]) {
cnt++;
q.push(k);
seen[k] = true;
}
}
}
return cnt == N;
}
};


Java

• class Solution {
public boolean canVisitAllRooms(List<List<Integer>> rooms) {
int length = rooms.size();
boolean[] visited = new boolean[length];
int visitCount = 0;
queue.offer(0);
while (!queue.isEmpty()) {
int room = queue.poll();
if (!visited[room]) {
visited[room] = true;
visitCount++;
List<Integer> keys = rooms.get(room);
for (int key : keys) {
if (!visited[key])
queue.offer(key);
}
}
}
return visitCount == length;
}
}

• // OJ: https://leetcode.com/problems/keys-and-rooms/
// Time: O(K) where K is the count of all the keys.
// Space: O(N) where N is the count of rooms
class Solution {
public:
bool canVisitAllRooms(vector<vector<int>>& A) {
int N = A.size(), cnt = 0;
vector<bool> seen(N);
seen = true;
queue<int> q;
q.push(0);
while (q.size()) {
int i = q.front();
q.pop();
++cnt;
for (int j : A[i]) {
if (seen[j]) continue;
seen[j] = true;
q.push(j);
}
}
return cnt == N;
}
};

• class Solution:
def canVisitAllRooms(self, rooms):
"""
:type rooms: List[List[int]]
:rtype: bool
"""
visited =  * len(rooms)
self.dfs(rooms, 0, visited)
return sum(visited) == len(rooms)

def dfs(self, rooms, index, visited):
visited[index] = 1
for key in rooms[index]:
if not visited[key]:
self.dfs(rooms, key, visited)