GoLang Solution For LeetCode Problem: Keys and Rooms
Solving Keys and Rooms in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
You can walk back and forth between rooms freely.
Input: [,,,] Output: true Explanation: We start in room 0, and pick up key 1. We then go to room 1, and pick up key 2. We then go to room 2, and pick up key 3. We then go to room 3. Since we were able to go to every room, we return true.
Input: [[1,3],[3,0,1],,] Output: false Explanation: We can't enter the room with number 2.
0 <= rooms[i].length <= 1000
- 0 <= rooms[i].length <= 1000
See the full details of the problem Keys and Rooms at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go