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.
Problem Description
You can walk back and forth between rooms freely.
Example 1:
Input: [[1],[2],[3],[]]
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.
Example 2:
Input: [[1,3],[3,0,1],[2],[0]]
Output: false
Explanation: We can't enter the room with number 2.
Note:
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
Comments
Leave a comment
You are not LoggedIn but you can comment as an anonymous user which requires manual approval. For better experience please Login.