字典树

typedef struct Trie {
    struct Trie* next[26];
    bool isEnd;
} Trie;//相当于26叉树

void init(Trie** p) {
    (*p) = (Trie*)malloc(sizeof(Trie));
    (*p)->isEnd = false;
    memset((*p)->next, NULL, sizeof((*p)->next));
}//初始化一个结点

void insert(Trie* p, char* s) {
    int n = strlen(s);
    for (int i = n - 1; i >= 0; --i) {
        int x = s[i] - 'a';
        if (p->next[x] == NULL) {
            init(&p->next[x]);
        }
        p = p->next[x];
    }
    p->isEnd = true;
}//插入一个字符串并在字典树中初始化。到达终点时设为true。

int respace(char** dictionary, int dictionarySize, char* sentence){
    Trie* root;
    init(&root);
    for (int i = 0; i < dictionarySize; ++i) {
        insert(root, dictionary[i]);
    }
    int n = strlen(sentence);
    int dp[n + 1];
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i < n + 1; ++i) {
        dp[i] = dp[i - 1] + 1;
        Trie* p = root;
        for (int j = i; j >= 1; --j) {
            int x = sentence[j - 1] - 'a';
            if (p->next[x] == NULL) {
                break;
            } else if (p->next[x]->isEnd) {
                dp[i] = fmin(dp[i], dp[j - 1]);
            }
            p = p->next[x];
        }
    }
    return dp[n];
}