class Solution {
public:
bool canVisitAllRooms(vector<vector<int>>& rooms) {
int sum=0;
int n=rooms.size();
queue<int> que;
que.push(0);
vector<int>visit(n,0);
visit[0]=1;
sum++;
while(!que.empty())
{
auto q=que.front();
que.pop();
for(auto x:rooms[q])
{
if(visit[x]==0)
{
visit[x]=1;
sum++;
que.push(x);
}
}
}
return sum==n;
}
};
leetcode 841. 钥匙和房间
最新推荐文章于 2024-05-07 11:23:13 发布