diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/keys_and_rooms.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/keys_and_rooms.cpp')
-rw-r--r-- | other/keys_and_rooms.cpp | 32 |
1 files changed, 0 insertions, 32 deletions
diff --git a/other/keys_and_rooms.cpp b/other/keys_and_rooms.cpp deleted file mode 100644 index 59308ef..0000000 --- a/other/keys_and_rooms.cpp +++ /dev/null @@ -1,32 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - bool canVisitAllRooms(vvd & rooms) { - stack<int> dfs; - dfs.push(0); - unordered_set<int> seen = {0}; - while (!dfs.empty()) { - int i = dfs.top(); - dfs.pop(); - for (int j : rooms[i]) { - if (seen.count(j) == 0) { - dfs.push(j); - seen.insert(j); - if (rooms.size() == seen.size()) - return true; - } - } - } - return rooms.size() == seen.size(); - } -}; - -int main() { - Solution obj; - vvd rooms = {{1}, {2}, {3}, {}}; - if (obj.canVisitAllRooms(rooms)) - cout << "true"; - else - cout << "false"; -} |