leetcode-211-Add and Search Word - Data structure design

#include <iostream>
#include <string.h>
using namespace std;
class WordDictionary {
public:
    struct node {
        bool end;
        node *child[26];
        node() {
            end = false;
            memset(child, 0, sizeof(child));
        }
    };
    WordDictionary() {
        root = NULL;
    }
    // Adds a word into the data structure.
    void addWord(string word) {
        if (!root) {
            root = new node();
        }
        int counter = 0;
        node *current = root;
        while (counter != word.length()) {
            if (!current->child[word[counter] - 'a']) {
                current->child[word[counter] - 'a'] = new node();
            }
            current = current->child[word[counter] - 'a'];
            counter++;
        }
        current->end = true;
    }
    bool search(node *start, string word) {
        if (!start) {
            return false;
        }
        if (word.length() == 0 && start->end) {
            return true;
        }
        if (word.length() == 0 && !start->end) {
            return false;
        }
        if (word[0] == '.') {
            for (int i = 0; i < 26; i++) {
                if (start->child[i]) {
                    if (search(start->child[i], word.c_str() + 1)) {
                        return true;
                    }
                }
            }
            return false;
        }
        if (start->child[word[0] - 'a']) {
            return search(start->child[word[0] - 'a'], word.c_str() + 1);
        }
        return false;
    }
    // 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 search(root, word);
    }
private:
    node *root;
};

// Your WordDictionary object will be instantiated and called as such:
// WordDictionary wordDictionary;
// wordDictionary.addWord("word");
// wordDictionary.search("pattern");
int main(int argc, const char * argv[]) {
     WordDictionary wordDictionary;
     wordDictionary.addWord("aa");
     wordDictionary.addWord("wef");
     cout << wordDictionary.search(".") << endl;
    // insert code here...
    std::cout << "Hello, World!\n";
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值