LeetCode题解之Keys and Rooms

1、题目描述

2、问题分析

使用深度优先遍历

3、代码

 bool canVisitAllRooms(vector<vector<int>>& rooms) {
         int nums = rooms.size();
         if ( nums == )
             return true;
         vector<int> R(nums, );
         R[] = ;

         stack<int> s;
         s.push();

         while (!s.empty()) {
             int room = s.top();
             s.pop();
             for(auto n : rooms[room])
                 if (R[n] == ) {
                     R[n] = ;
                     s.push(n);
                 }
         }

         return count(R.begin(), R.end(), ) == R.size();

     }