LeetCode-208-实现前缀树-C语言

typedef struct Node {
    struct Node *letter[128];
} Trie;

Trie* trieCreate() {
    Trie *node = (Trie *)malloc(sizeof(Trie));
    
    memset(node, 0, sizeof(Trie));
    
    return node;
}

/** Inserts a word into the trie. */
void trieInsert(Trie* obj, char * word) {
    Trie *node = (Trie *)malloc(sizeof(Trie));
    
    memset(node, 0, sizeof(Trie));
    
    if(*word == '\0'){
        /* there must be, this node has a end sign */
        obj->letter[*word] = node;
        return;
    }
    
    if(obj->letter[*word] == NULL){
        obj->letter[*word] = node;
    
        trieInsert(obj->letter[*word], word+1);
    }else{
        free(node);
        trieInsert(obj->letter[*word], word+1);
    }
}

/** Returns if the word is in the trie. */
bool trieSearch(Trie* obj, char * word) {
    if(!obj)
        return false;
    
    if((*word) == '\0'){
        if(obj->letter[*word]){
            return true;
        } else{
            return false;
        }
    }
        
    return trieSearch(obj->letter[(*word)], word+1);;
}

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

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

    free(obj);
}

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