C语言设计题6-实现一个魔法字典

最新推荐文章于 2024-07-22 16:27:42 发布

文卿的藏剑山庄

最新推荐文章于 2024-07-22 16:27:42 发布

阅读量162

点赞数

分类专栏： C语言设计题 leetcode 文章标签： c语言 leetcode 算法

本文链接：https://blog.csdn.net/qq_37651325/article/details/129315941

版权

leetcode 同时被 2 个专栏收录

142 篇文章 1 订阅

订阅专栏

C语言设计题

6 篇文章 0 订阅

订阅专栏

题目

676. 实现一个魔法字典

代码

思路很简单，暴力实现即可，逐一对比。

typedef struct {
    char **words;
    int wordsSize;
} MagicDictionary;

MagicDictionary *magicDictionaryCreate() {
    MagicDictionary *obj = (MagicDictionary *)malloc(sizeof(MagicDictionary));
    return obj;
}

void magicDictionaryBuildDict(MagicDictionary *obj, char **dictionary, int dictionarySize) {
    obj->words = dictionary;
    obj->wordsSize = dictionarySize;
}

bool magicDictionarySearch(MagicDictionary *obj, char *searchWord) {
    int length = strlen(searchWord);
    for (int i = 0; i < obj->wordsSize; i++) {
        if (length != strlen(obj->words[i])) {
            continue;
        }
        int diff = 0;
        for (int j = 0; j < length; j++) {
            if (searchWord[j] != obj->words[i][j]) {
                diff++;
                if (diff > 1) {
                    continue;
                }
            }        
        }
        if (diff == 1) {
            return true;
        }
    }
    return false;
}

void magicDictionaryFree(MagicDictionary *obj) {
    free(obj);
}