一、题目
![在这里插入图片描述](https://img-blog.csdnimg.cn/7ac97f64340c49168f7bc69be9dc54d9.png)
![在这里插入图片描述](https://img-blog.csdnimg.cn/e7df0d38bf25465d91146123f245de79.png)
二、代码
class Solution
{
public boolean canVisitAllRooms(List<List<Integer>> rooms)
{
int i,j;
Queue<Integer> queue = new LinkedList<>();
int num = 0;
Map<Integer, Boolean> map = new HashMap<>();
int length = rooms.size();
for(i=0;i<length;i++)
{
map.put(i,false);
}
for(Map.Entry<Integer,Boolean> entry : map.entrySet())
{
int key = entry.getKey();
boolean value = entry.getValue();
System.out.println(" key "+ key+ " value "+value);
}
length = rooms.get(0).size();
queue.offer(0);
map.put(0,true);
while(!queue.isEmpty())
{
int index = queue.poll();
length = rooms.get(index).size();
System.out.println(" 大小 "+ length+" 下标 " +index);
for(i=0;i<length;i++)
{
int temp_num = rooms.get(index).get(i);
System.out.println(" temp_num "+ temp_num);
if(map.get(temp_num) == false )
{
queue.offer(temp_num);
map.put(temp_num,true);
}
}
}
for(Map.Entry<Integer,Boolean> entry : map.entrySet())
{
int key = entry.getKey();
boolean value = entry.getValue();
System.out.println(" key "+ key+ " value "+value);
}
if(map.containsValue(false)) return false;
return true;
}
}
三、运行结果
![在这里插入图片描述](https://img-blog.csdnimg.cn/5d3bfabd27064816996b9bebc4006771.png)