/
trie.go
134 lines (120 loc) · 2.06 KB
/
trie.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
122
123
124
125
126
127
128
129
130
131
132
133
134
/**
* Created: 2020/3/27
* @author: Jason
*/
package utils
import "sync"
type TrieNode struct {
Children sync.Map //map[rune]*TrieNode
End bool
}
func NewTrieNode() *TrieNode {
t := &TrieNode{
End: false,
}
return t
}
type Trie struct {
Node *TrieNode
}
func NewTrie() *Trie {
return &Trie{
Node: NewTrieNode(),
}
}
func (t *Trie) Add(text string) {
if len(text) == 0 {
return
}
chars := []rune(text)
charLen := len(chars)
node := t.Node
for i := 0; i < charLen; i++ {
var v *TrieNode = nil
key := chars[i]
childrenNode, ok := node.Children.Load(key)
if !ok {
v = NewTrieNode()
node.Children.Store(key, v)
} else {
v = childrenNode.(*TrieNode)
}
node = v
}
node.End = true
}
func (t *Trie) Find(text string) bool {
chars := []rune(text)
charLen := len(chars)
node := t.Node
for i := 0; i < charLen; i++ {
key := chars[i]
childrenNode, ok := node.Children.Load(key)
if !ok {
continue
}
v, ok := childrenNode.(*TrieNode)
if !ok {
continue
}
node = v
for j := i + 1; j < charLen; j++ {
key2 := chars[j]
childrenNode2, ok := node.Children.Load(key2)
if !ok {
break
}
v, ok := childrenNode2.(*TrieNode)
if !ok {
continue
}
node = v
if node.End {
return true
}
}
node = t.Node
}
return false
}
func (t *Trie) Replace(text string) (string, []string) {
chars := []rune(text)
charLen := len(chars)
node := t.Node
result := []rune(text)
find := make([]string, 0, 8)
for i := 0; i < charLen; i++ {
key := chars[i]
childrenNode, ok := node.Children.Load(key)
if !ok {
continue
}
v, ok := childrenNode.(*TrieNode)
if !ok {
continue
}
node = v
for j := i + 1; j < charLen; j++ {
key2 := chars[j]
childrenNode2, ok := node.Children.Load(key2)
if !ok {
break
}
v, ok := childrenNode2.(*TrieNode)
if !ok {
continue
}
node = v
if node.End {
for n := i; n <= j; n++ {
result[n] = '*'
}
find = append(find, string(chars[i:j+1]))
i = j
break
}
}
node = t.Node
}
return string(result), find
}