[LeetCode] 841. Keys and Rooms

题：https://leetcode.com/problemset/all/?difficulty=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: [[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.

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.

题目大意

确定 图是否是 全连通的。

思路

bfs 遍历，因为有环需要 hasVisted 作为标记。
这里的 bfs 可以改变下，不用 每圈 停顿，没有响应的操作。

class Solution {
    public boolean canVisitAllRooms(List<List<Integer>> rooms) {
        int N = rooms.size();
        boolean[]  hasVistied = new boolean[N];
        Queue<Integer> queue = new LinkedList<>();
        queue.add(0);
        hasVistied[0] = true;
        int  cnt = 1;
        while(!queue.isEmpty()){
                int curNode = queue.poll();
                for(int nextNode : rooms.get(curNode)){
                    if(hasVistied[nextNode])
                        continue;
                    hasVistied[nextNode] = true;
                    cnt++;
                    queue.add(nextNode);
                }
        }
        return cnt == N;
    }
}