设计一个支持以下两种操作的数据结构:
void addWord(word) bool search(word) search(word)
可以搜索文字或正则表达式字符串,字符串只包含字母 . 或 a-z 。 . 可以表示任何一个字母。示例:
addWord(“bad”) addWord(“dad”) addWord(“mad”) search(“pad”) -> false
search(“bad”) -> true search(".ad") -> true search(“b…”) -> true 说明:你可以假设所有单词都是由小写字母 a-z 组成的。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/add-and-search-word-data-structure-design
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
使用Trie,效率不高,280ms
节点定义需要放在前面,不然会报错。
class WordDictionary {
class Node {
public:
bool isWord;
map<char, Node*>* next;
Node() {
this->isWord = false;
next = new map<char, Node*>();
}
};
public:
/** Initialize your data structure here. */
WordDictionary() {
root = new Node();
}
/** Adds a word into the data structure. */
void addWord(string word) {
Node* cur = root;
for (char c : word) {
if (cur->next->count(c) == 0) {
cur->next->insert(make_pair(c, new Node()));
}
cur = cur->next->at(c);
}
if (!cur->isWord) {
cur->isWord = true;
}
}
bool search(string word) {
Node* cur = root;
return Match(cur, word, 0);
}
bool Match(Node* node, string word, int index) {
if (index == word.size())
return node->isWord;
char c = word.at(index);
if (c != '.') {
if (node->next->count(c) == 0) {
return false;
}
return Match(node->next->at(c), word, index + 1);
}
else {
map<char, Node*>::iterator it;
for (it = node->next->begin(); it != node->next->end(); it++) {
if (Match(node->next->at(it->first), word, index + 1)) {
return true;
}
}
return false;
}
}
/** Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter. */
private:
Node* root;
};