LeetCode题解之Keys and Rooms

1、题目描述

 

2、问题分析

使用深度优先遍历

 

3、代码

bool canVisitAllRooms(vector<vector<int>>& rooms) {
        int nums = rooms.size();
        if ( nums == 1)
            return true;
        vector<int> R(nums, 0);
        R[0] = 1;
        
        stack<int> s;
        s.push(0);
        
        while (!s.empty()) {
            int room = s.top();
            s.pop();
            for(auto n : rooms[room])
                if (R[n] == 0) {
                    R[n] = 1;
                    s.push(n);
                }
        }
       
        
        return count(R.begin(), R.end(), 1) == R.size();
        
        
    }