[leetcode]208. 实现 Trie (前缀树)

数据结构：字典树
1.题目：
实现一个 Trie (前缀树)，包含 insert, search, 和 startsWith 这三个操作。

示例:

Trie trie = new Trie();

trie.insert("apple");
trie.search("apple");   // 返回 true
trie.search("app");     // 返回 false
trie.startsWith("app"); // 返回 true
trie.insert("app");   
trie.search("app");     // 返回 true

2.代码：

#define MAXN 30

typedef struct Trie{
    bool end;
    struct Trie* next[MAXN];
}Trie;

/** Initialize your data structure here. */
Trie* trieCreate() {
    Trie* tree=(Trie* )malloc(sizeof(Trie)); 
    tree->end=false;
    for(int i=0;i<MAXN;i++)
        tree->next[i]=NULL;
    return tree;
}

/** Inserts a word into the trie. */
void trieInsert(Trie* obj, char* word) {
    int i=0,k;
    Trie* t=obj;
    while(word[i]){    
        k=word[i]-'a';
        if(!t->next[k]){
            Trie* temp=trieCreate();
            t->next[k]=temp;
        }
        t=t->next[k];                               
        i++;
    }
    t->end=true;
}

/** Returns if the word is in the trie. */
bool trieSearch(Trie* obj, char* word) {    
    int i=0,k;
    Trie* t=obj;
    while(word[i]){      
        k=word[i]-'a';
        if(!t->next[k])
           return false;
        t=t->next[k];
        i++;
    }
    if(t->end)
        return true;      
    return false;
}

/** Returns if there is any word in the trie that starts with the given prefix. */
bool trieStartsWith(Trie* obj, char* prefix) {    
    int i=0,k;
    Trie* t=obj;
    while(prefix[i]){  
        k=prefix[i]-'a';
        if(!t->next[k])
           return false;
        t=t->next[k];
        i++;
    }
    return true;
}

void trieFree(Trie* obj) {    
    if(!obj)
        return;
    for(int i=0;i<MAXN;i++){
        if(obj->next[i])
            trieFree(obj->next[i]);
    }
    free(obj);
}

/**
 * Your Trie struct will be instantiated and called as such:
 * struct Trie* obj = trieCreate();
 * trieInsert(obj, word);
 * bool param_2 = trieSearch(obj, word);
 * bool param_3 = trieStartsWith(obj, prefix);
 * trieFree(obj);
 */

3.知识点：

字典树