【C语言刷LeetCode】面试题 16.02. 单词频率(M)

【

设计一个方法，找出任意指定单词在一本书中的出现频率。

你的实现应该支持如下操作：

WordsFrequency(book)构造函数，参数为字符串数组构成的一本书
get(word)查询指定单词在书中出现的频率
示例：

WordsFrequency wordsFrequency = new WordsFrequency({"i", "have", "an", "apple", "he", "have", "a", "pen"});
wordsFrequency.get("you"); //返回0，"you"没有出现过
wordsFrequency.get("have"); //返回2，"have"出现2次
wordsFrequency.get("an"); //返回1
wordsFrequency.get("apple"); //返回1
wordsFrequency.get("pen"); //返回1
提示：

book[i]中只包含小写字母
1 <= book.length <= 100000
1 <= book[i].length <= 10
get函数的调用次数不会超过100000

来源：力扣（LeetCode）
链接：https://leetcode.cn/problems/words-frequency-lcci
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

】

字符串哈希，相对于INT类型，接口稍微变下：

typedef struct {
    char name[11];
    int val;
    UT_hash_handle hh;
} WordsFrequency;


WordsFrequency* wordsFrequencyCreate(char** book, int bookSize) {
    int i;
    WordsFrequency *myhash = NULL;
    WordsFrequency *tmp = NULL;
    
    for (i = 0; i < bookSize; i++) {
        tmp = NULL;
        HASH_FIND_STR(myhash, book[i], tmp);
        if (tmp != NULL) {
            tmp->val += 1;
        } else {
            WordsFrequency *new = malloc(sizeof(WordsFrequency));
            strcpy(new->name, book[i]);
            new->val = 1;
            HASH_ADD_STR(myhash, name, new);
        }
    }
    
    return myhash;
}

int wordsFrequencyGet(WordsFrequency* obj, char* word) {
    WordsFrequency *tmp = NULL;
    
    HASH_FIND_STR(obj, word, tmp);
    if (tmp != NULL) {
        return tmp->val;
    } else {
        return 0;
    }
}

void wordsFrequencyFree(WordsFrequency* obj) {
    /*WordsFrequency *cur = NULL;
    WordsFrequency *tmp = NULL;
    
    HASH_ITER(hh, obj, cur, tmp) {
        HASH_DEL(obj, cur);
        free(cur);
    }*/

    HASH_CLEAR(hh, obj);
}