Leetcode 211 Add and Search Word - Data structure design

最新推荐文章于 2024-09-18 21:46:14 发布

triplebee

最新推荐文章于 2024-09-18 21:46:14 发布

阅读量1.2k

点赞数 1

分类专栏： leetcode 基础小题大做——Leetcode算法文章标签： acm algorithm c++ leetcode 工作面试

本文链接：https://blog.csdn.net/accepthjp/article/details/63686114

版权

小题大做——Leetcode算法同时被 3 个专栏收录

239 篇文章 64 订阅

订阅专栏

leetcode

236 篇文章 0 订阅

订阅专栏

基础

235 篇文章 0 订阅

订阅专栏

Design a data structure that supports the following two operations:

void addWord(word)
bool search(word)

search(word) can search a literal word or a regular expression string containing only letters a-z or .. A . means it can represent any one letter.

For example:

addWord("bad")
addWord("dad")
addWord("mad")
search("pad") -> false
search("bad") -> true
search(".ad") -> true
search("b..") -> true

Note:
You may assume that all words are consist of lowercase letters a-z.

设计数据结构存储单词，并满足用简单的正则表达式查询。

在字典树这题的基础上修改http://blog.csdn.net/accepthjp/article/details/63254529

为了满足正则匹配符点的模糊查询，将search方法改为递归形式。注意判断要查询的下一个节点是否存在

class node  
{  
    public:  
    int flag;  
    node* next[26];  
    node(int x = 0)  
    {  
        flag = x;  
        memset(next, 0, sizeof(next));  
    }  
};  
class WordDictionary {
public:
    node* root;
    /** Initialize your data structure here. */
    WordDictionary() {
        root = new node();
    }
    /** Adds a word into the data structure. */
    void addWord(string word) {
        node* p = root;  
        for(int i = 0; i < word.size(); i++)  
        {  
            if(!p->next[word[i] - 'a']) p->next[word[i] - 'a'] = new node();  
            p = p->next[word[i] - 'a'];  
        }  
        p->flag = 1; 
    }
    /** Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter. */
    bool search(string word) {
        return dfs(word, root);
    }
    bool dfs(string word, node* now)
    {
        if(word.size() == 0) 
        {
            if(now->flag) return true;
            return false;
        }
        if(word[0]!='.')
        {
            if(!now->next[word[0] - 'a']) return false;
            return dfs(word.substr(1), now->next[word[0]-'a']);
        }
        else
            for(int i = 0; i < 26; i++) if(now->next[i] && dfs(word.substr(1), now->next[i])) return true;
        return false;
    }
};
/**
 * Your WordDictionary object will be instantiated and called as such:
 * WordDictionary obj = new WordDictionary();
 * obj.addWord(word);
 * bool param_2 = obj.search(word);
 */