-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathkeys-and-rooms.go
More file actions
66 lines (56 loc) · 1.1 KB
/
keys-and-rooms.go
File metadata and controls
66 lines (56 loc) · 1.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package main
import (
"fmt"
)
// source: https://leetcode.com/problems/keys-and-rooms/
func canVisitAllRooms(rooms [][]int) bool {
n, cnt := len(rooms), 0
visited := make([]bool, n)
queue := []int{0}
for len(queue) > 0 {
v := queue[0]
queue = queue[1:]
if visited[v] {
continue
}
visited[v] = true
cnt++
for _, k := range rooms[v] {
if visited[k] {
continue
}
queue = append(queue, k)
}
}
return cnt == n
}
func main() {
testCases := []struct {
rooms [][]int
want bool
}{
{
rooms: [][]int{{1}, {2}, {3}, {}},
want: true,
},
{
rooms: [][]int{{1, 3}, {3, 0, 1}, {2}, {0}},
want: false,
},
}
successes := 0
for _, tc := range testCases {
x := canVisitAllRooms(tc.rooms)
status := "ERROR"
if fmt.Sprint(x) == fmt.Sprint(tc.want) {
status = "OK"
successes++
}
fmt.Println(status, " Expected: ", tc.want, " Actual: ", x)
}
if l := len(testCases); successes == len(testCases) {
fmt.Printf("===\nSUCCESS: %d of %d tests ended successfully\n", successes, l)
} else {
fmt.Printf("===\nFAIL: %d tests failed\n", l-successes)
}
}