-
Notifications
You must be signed in to change notification settings - Fork 2
/
sliding_window_method.go
121 lines (101 loc) · 2.06 KB
/
sliding_window_method.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
118
119
120
121
package main
import "reflect"
// Use the sliding window method to find all anagrams in a string
func findAnagrams(full string, anagram string) []int {
var (
result []int
sample = []rune(full)
gram = make(map[rune]int)
mirror = make(map[rune]int)
)
for _, character := range anagram {
gram[character]++
}
windowStart := 0
windowLength := len(anagram)
anagramStart := 0
reset := true
for index := 0; index < len(sample); index++ {
if windowStart+windowLength == index {
windowStart++
index = windowStart
mirror = make(map[rune]int)
reset = true
}
character := sample[index]
if _, ok := gram[character]; ok {
if reset {
anagramStart = index
}
mirror[character]++
reset = false
} else {
reset = true
windowStart = index
if len(mirror) > 0 {
mirror = make(map[rune]int)
}
continue
}
if reflect.DeepEqual(gram, mirror) {
result = append(result, anagramStart)
}
}
return result
}
/*
* Alternative solution
*/
func findAnagramsAlt(full string, anagram string) []int {
var (
result []int
sample = []rune(full)
gram = make(map[rune]int)
mirror = make(map[rune]int)
)
for _, character := range anagram {
gram[character]++
mirror[character]++
}
windowStart := 0
windowLength := len(anagram)
anagramStart := 0
reset := true
for index := 0; index < len(sample); index++ {
if windowStart+windowLength == index {
windowStart++
index = windowStart
mirror = copyMap(gram)
reset = true
}
character := sample[index]
if _, ok := gram[character]; ok {
if reset {
anagramStart = index
}
mirror[character]--
if mirror[character] == 0 {
delete(mirror, character)
}
reset = false
} else {
reset = true
windowStart = index
if len(mirror) > 0 {
mirror = copyMap(gram)
}
continue
}
if len(mirror) == 0 {
result = append(result, anagramStart)
}
}
return result
}
func copyMap(input map[rune]int) map[rune]int {
var result = make(map[rune]int, len(input))
for key, value := range input {
result[key] = value
}
return result
}