LeetCode/211_AddAndSearchWord.py at master · brettchien/LeetCode · GitHub

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
class TrieNode:
    # Initialize your data structure here.
    def __init__(self):
        self.children = {}
        self.end = False

    def __contains__(self, key):
        return key in self.children

    def __getitem__(self, key):
        return self.children[key]

    def __setitem__(self, key, value):
        if key not in self.children:
            self.children[key] = value

class Trie:

    def __init__(self):
        self.root = TrieNode()

    # @param {string} word
    # @return {void}
    # Inserts a word into the trie.
    def insert(self, word):
        node = self.root
        for ch in word:
            if ch not in node:
                node[ch] = TrieNode()
            node = node[ch]
        node.end = True


    # @param {string} word
    # @return {boolean}
    # Returns if the word is in the trie.
    def search(self, word):
        node = self.root
        for ch in word:
            if ch in node:
                node = node[ch]
            else:
                return False
        return node.end


    # @param {string} prefix
    # @return {boolean}
    # Returns if there is any word in the trie
    # that starts with the given prefix.
    def startsWith(self, prefix):
        node = self.root
        for ch in prefix:
            if ch in node:
                node = node[ch]
            else:
                return False
        return True


# Your Trie object will be instantiated and called as such:
# trie = Trie()
# trie.insert("somestring")
# trie.search("key")

class WordDictionary:
    # initialize your data structure here.
    def __init__(self):
        self.trie = Trie()

    # @param {string} word
    # @return {void}
    # Adds a word into the data structure.
    def addWord(self, word):
        self.trie.insert(word)

    # @param {string} word
    # @return {boolean}
    # Returns if the word is in the data structure. A word could
    # contain the dot character '.' to represent any one letter.
    def search(self, word):
        nodes = [self.trie.root]
        for w in word:
            newNodes = []
            for node in nodes:
                if w == '.':
                    for ch in node.children:
                        newNodes.append(node.children[ch])
                else:
                    if w in node:
                        newNodes.append(node[w])
            if not newNodes:
                return False
            nodes = newNodes
        for node in nodes:
            if node.end:
                return True
        return False

# Your WordDictionary object will be instantiated and called as such:
# wordDictionary = WordDictionary()
# wordDictionary.addWord("word")
# wordDictionary.search("pattern")

if __name__ == "__main__":
    wd = WordDictionary()
    wd.addWord("aa")
    wd.addWord("ab")
    wd.addWord("ca")
    wd.addWord("da")
    wd.addWord("ef")
    wd.addWord("gf")
    wd.addWord("abc")
    print wd.search(".")
    print wd.search("ac")
    print wd.search("abc")
    print wd.search("a.c")