-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcan-place-flowers.go
55 lines (48 loc) · 1.05 KB
/
can-place-flowers.go
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
package main
import (
"fmt"
)
// source: https://leetcode.com/problems/can-place-flowers/
func canPlaceFlowers(flowerbed []int, n int) bool {
l := len(flowerbed)
for i := range flowerbed {
if flowerbed[i] == 0 && (i == 0 || flowerbed[i-1] == 0) && (i == l-1 || flowerbed[i+1] == 0) {
flowerbed[i] = 1
n--
}
}
return n <= 0
}
func main() {
testCases := []struct {
flowerbed []int
n int
want bool
}{
{
flowerbed: []int{1, 0, 0, 0, 1},
n: 1,
want: true,
},
{
flowerbed: []int{1, 0, 0, 0, 1},
n: 2,
want: false,
},
}
successes := 0
for _, tc := range testCases {
x := canPlaceFlowers(tc.flowerbed, tc.n)
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)
}
}