-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1-bit-and-2-bit-characters.go
More file actions
62 lines (56 loc) · 998 Bytes
/
1-bit-and-2-bit-characters.go
File metadata and controls
62 lines (56 loc) · 998 Bytes
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
package main
import (
"fmt"
)
func isOneBitCharacter(bits []int) bool {
last, before := len(bits)-1, -1
for i := len(bits) - 2; i >= 0; i-- {
if bits[i] == 0 {
before = i
break
}
}
return (last-before+1)%2 == 0
}
func main() {
testCases := []struct {
bits []int
want bool
}{
{
bits: []int{0, 0},
want: true,
},
{
bits: []int{1, 0, 0},
want: true,
},
{
bits: []int{0},
want: true,
},
{
bits: []int{1, 0},
want: false,
},
{
bits: []int{1, 1, 1, 0},
want: false,
},
}
successes := 0
for _, tc := range testCases {
x := isOneBitCharacter(tc.bits)
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)
}
}