841.md

Keys and Rooms

Description

link

---

Solution

• See Code

---

Code

最坏情况：O(n^2)

class Solution:
    def canVisitAllRooms(self, rooms: List[List[int]]) -> bool:
        seen = set([0])
        N = len(rooms)
        state = [0]
        while state:
            r = state.pop()
            for i in rooms[r]:
                if i not in seen:
                    state.append(i)
                    seen.add(i)
            if len(seen) == N: return True
        return False