算法设计与分析（四）：Graph And Tree

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 1:

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.

Example 2:

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

---

题目询问是否能够到达所有的房间，事实上我们可以直接把能够到达的房间求出来。这是一个从0号房间开始，一步步向下搜索的过程。显然，我们可以将到达房间的过程类比为，从一个节点出发，向他的相邻节点（子节点）前进的过程。这个问题是一个图的搜索问题，房间相当于图中的节点，钥匙相当于节点之间的边。所以，我们可以用DFS(深度优先)或者BFS(宽度优先)来求解，这两种方法都类似，不过DFS速度更快一些。

DFS的C++算法如下：

class Solution {
public:
     void bfs(vector<vector<int>>& rooms, int id, vector<bool>& visited) {
        visited[id] = true;
        for(vector<int>::iterator it = rooms[id].begin();it != rooms[id].end(); ++it) {
            if(visited[*it] == false) bfs (rooms,*it,visited);
        } 
    }
    
    bool canVisitAllRooms(vector<vector<int>>& rooms) {
        vector<bool> visited(rooms.size());
        for(vector<bool>::iterator it = visited.begin();it != visited.end(); ++ it) {
            *it =false;
        }

        bfs(rooms,0,visited);
        
        for(vector<bool>::iterator it = visited.begin();it != visited.end(); ++ it) {
            //cout << *it << endl;
            if(*it == false) return false;
        }
        return true;
    }
};

DFS的C++算法如下：

class Solution {
    void dfs(vector<vector<int>>& rooms, unordered_set<int> & keys, unordered_set<int> & visited, int curr) {
        visited.insert(curr);
        for (int k : rooms[curr]) keys.insert(k);
        for (int k : keys) if (visited.find(k) == visited.end()) dfs(rooms, keys, visited, k);
    }
    
public:
    bool canVisitAllRooms(vector<vector<int>>& rooms) {
        unordered_set<int> keys;
        unordered_set<int> visited;
        dfs(rooms, keys, visited, 0);
        return visited.size() == rooms.size();
    }
};

附上LeetCode链接：https://leetcode.com/problems/keys-and-rooms/description/