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
|
package main
import "fmt"
/**
Design a data structure that supports adding new words and finding if a string matches any previously added string.
Implement the WordDictionary class:
WordDictionary() Initializes the object.
void addWord(word) Adds word to the data structure, it can be matched later.
bool search(word) Returns true if there is any string in the data structure that matches word or false otherwise. word may contain dots '.' where dots can be matched with any letter.
Example:
Input
["WordDictionary","addWord","addWord","addWord","search","search","search","search"]
[[],["bad"],["dad"],["mad"],["pad"],["bad"],[".ad"],["b.."]]
Output
[null,null,null,null,false,true,true,true]
Explanation
WordDictionary wordDictionary = new WordDictionary();
wordDictionary.addWord("bad");
wordDictionary.addWord("dad");
wordDictionary.addWord("mad");
wordDictionary.search("pad"); // return False
wordDictionary.search("bad"); // return True
wordDictionary.search(".ad"); // return True
wordDictionary.search("b.."); // return True
Constraints:
1 <= word.length <= 25
word in addWord consists of lowercase English letters.
word in search consist of '.' or lowercase English letters.
There will be at most 2 dots in word for search queries.
At most 104 calls will be made to addWord and search.
**/
type WordDictionary struct {
is_terminal bool
children [26]*WordDictionary
}
func Constructor() WordDictionary {
return WordDictionary{
is_terminal: false,
children: [26]*WordDictionary{},
}
}
func (this *WordDictionary) AddWord(word string) {
cur := this
for _, char := range word {
fmt.Println(char)
ascii := char - 97
if cur.children[ascii] == nil {
tmp := Constructor()
cur.children[ascii] = &tmp
}
cur = cur.children[ascii]
}
cur.is_terminal = true
}
func (this *WordDictionary) Search(word string) bool {
cur := this
for idx, char := range word {
if char == '.' {
for _, child := range cur.children {
if child != nil {
fmt.Printf("RECURSIVE SEARCHING %s for entry word %s\n", word[idx+1:], word)
if child.Search(word[idx+1:]) {
return true
}
}
}
return false
}
ascii := char - 97
next := cur.children[ascii]
if next == nil {
return false
}
cur = next
}
return cur.is_terminal
}
/**
* Your WordDictionary object will be instantiated and called as such:
* obj := Constructor();
* obj.AddWord(word);
* param_2 := obj.Search(word);
*/
func main() {
wordDictionary := Constructor()
wordDictionary.AddWord("bad")
wordDictionary.AddWord("dad")
wordDictionary.AddWord("mad")
fmt.Println(wordDictionary.Search("pad")) // return False
fmt.Println(wordDictionary.Search("bad")) // return True
fmt.Println(wordDictionary.Search(".ad")) // return True
fmt.Println(wordDictionary.Search("b..")) // return True
}
|
