字符串-KMP-2—算法—6.14

int len = 0;
int i = 1;
while (i < m) {
    if (pattern[i] == pattern[len]) {
        partialMatchTable[i] = len + 1;
        len++;
        i++;
    } else {
        if (len != 0) {
            len = partialMatchTable[len - 1];
        } else {
            partialMatchTable[i] = 0;
            i++;
        }
    }
}

字符串的匹配

    int i = 0; // 文本串的索引
    int j = 0; // 模式串的索引
    while (i < n) {
        if (pattern[j] == text[i]) {
            i++;
            j++;
        }
        if (j == m) {
            std::cout << "Pattern found at index " << i - j << std::endl;
            j = partialMatchTable[j - 1];
        } else if (i < n && pattern[j] != text[i]) {
            if (j != 0) {
                j = partialMatchTable[j - 1];
            } else {
                i++;
            }
        }
    }