[LeetCode 75] Medium - 841. Keys and Rooms

841. Keys and Rooms

 

- 꼭 방문 순서가, 순차적일 필요는 없고. 
- 방문 한 방 개수 == 방 개수 의 로직으로 출어야 함
- DFS로.. => queue 사용

class Solution:
    def canVisitAllRooms(self, rooms: List[List[int]]) -> bool:
        visited = set()

        que = deque([0])

        while que:
            cur_room = que.popleft()
            if cur_room in visited:
                continue

            visited.add(cur_room)
            
            for k in rooms[cur_room]:
                if k not in visited:
                    que.append(k)

        return len(visited) == len(rooms)

 

https://youtu.be/xScQ-2JUvAI?si=J5xBY5p8zcfRabp2