-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
117 lines (91 loc) · 1.64 KB
/
main.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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
package main
import (
"bufio"
"fmt"
"os"
"strings"
)
func main() {
var niceStrings int
var niceStrings2 int
scanner := bufio.NewScanner(os.Stdin)
for scanner.Scan() {
if nice(scanner.Text()) {
niceStrings++
}
if nice2(scanner.Text()) {
niceStrings2++
}
}
fmt.Printf("Part 1: %d\n", niceStrings)
fmt.Printf("Part 2: %d\n", niceStrings2)
}
func nice(s string) bool {
return hasN(s, 3, "aeiou") &&
hasDoubleLetter(s) &&
!hasForbiddenString(s, []string{"ab", "cd", "pq", "xy"})
}
func nice2(s string) bool {
return hasTwoNonOverlappingPairs(s) && hasRepeatedLetterWithOneInbetween(s)
}
func hasN(s string, n int, set string) bool {
var count int
for _, r := range s {
for _, v := range set {
if r == v {
count++
}
if count >= n {
return true
}
}
}
return false
}
func hasDoubleLetter(s string) bool {
var lastR rune
for _, r := range s {
if lastR == r {
return true
}
lastR = r
}
return false
}
func hasForbiddenString(s string, forbidden []string) bool {
for _, f := range forbidden {
if strings.Contains(s, f) {
return true
}
}
return false
}
func hasTwoNonOverlappingPairs(s string) bool {
pairs := map[string]struct{}{}
var (
lastR rune
lastPair string
)
for n, r := range s {
if n != 0 {
pair := string([]rune{lastR, r})
if _, ok := pairs[pair]; ok {
return true
}
pairs[lastPair] = struct{}{}
lastPair = pair
}
lastR = r
}
return false
}
func hasRepeatedLetterWithOneInbetween(s string) bool {
var lastR, lastLastR rune
for _, r := range s {
if r == lastLastR {
return true
}
lastR, lastLastR = r, lastR
}
return false
}