Leetcode-841. Keys and Rooms 钥匙和房间（DFS/BFS） -python

最新推荐文章于 2020-12-09 06:56:37 发布

简米

最新推荐文章于 2020-12-09 06:56:37 发布

阅读量251

点赞数

分类专栏： Leetcode 文章标签： leetcode dfs python bfs

本文链接：https://blog.csdn.net/JamieLuo/article/details/106581777

版权

Leetcode 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

题目

有 N 个房间，开始时你位于 0 号房间。每个房间有不同的号码：0，1，2，…，N-1，并且房间里可能有一些钥匙能使你进入下一个房间。
在形式上，对于每个房间 i 都有一个钥匙列表 rooms[i]，每个钥匙 rooms[i][j] 由 [0,1，…，N-1] 中的一个整数表示，其中 N = rooms.length。钥匙 rooms[i][j] = v 可以打开编号为 v 的房间。
最初，除 0 号房间外的其余所有房间都被锁住。
你可以自由地在房间之间来回走动。
如果能进入每个房间返回 true，否则返回 false。
链接：https://leetcode.com/problems/keys-and-rooms/

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:

Input: [[1],[2],[3],[]]
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.

思路及代码

DFS

class Solution:
    def canVisitAllRooms(self, rooms: List[List[int]]) -> bool:
        def dfs(keys):
            if not keys:
                return
            for key in keys:
                if visited[key]:
                    continue
                visited[key] = 1
                dfs(rooms[key])
        
        visited = [1] + [0] * (len(rooms)-1)
        dfs(rooms[0])
        return sum(visited) == len(rooms)

BFS

class Solution:
    def canVisitAllRooms(self, rooms: List[List[int]]) -> bool:
        visited = [1] + [0] * (len(rooms)-1)
        key = [key for key in rooms[0]]
        while key:
            now = key.pop(0)
            if visited[now]:
                continue
            visited[now] = 1
            for k in rooms[now]:
                key.append(k)
        return sum(visited) == len(rooms)