串的模式匹配KMP算法模板

/*串的模式匹配KMP算法模板，位置序号从1开始*/
#include <iostream>
#include <cstring>

using namespace std;
//求模式串T的next函数修正值并存入数组nextval，数组下标从1开始
void GetNextVal(char T[], int nextval[]) {
    int i = 1, j = 0, LenT = strlen(T) - 1;
    nextval[1] = 0;
    while (i < LenT) {
        if (j == 0 || T[i] == T[j]) {
            ++i;
            ++j;
            if (T[i] != T[j])
                nextval[i] = j;
            else
                nextval[i] = nextval[j];
        }
        else
            j = nextval[j];
    }
}
//求模式串T在主串S中第pos个字符之后的位置，pos从1开始
int IndexKMP(char S[], char T[], int pos, int nextval[]) {
    int i = pos, j = 1, LenS = strlen(S) - 1, LenT = strlen(T) - 1;
    while (i <= LenS && j <= LenT) {
        if (j == 0 || S[i] == T[j]) {
            ++i;
            ++j; //继续比较后继字符
        }
        else
            j = nextval[j]; //模式串向右移动
    }
    if (j > LenT)
        return i - LenT; //匹配成功
    else
        return 0;
}

int main() {
    int Len1, Len2, pos;
    cout << "请输入主串的长度：";
    cin >> Len1;
    char * S = new char[Len1 + 2];
    cout << "请输入主串：";
    cin >> &S[1];
    cout << "请输入模式串的长度：";
    cin >> Len2;
    char * T = new char[Len2 + 2];
    cout << "请输入模式串：";
    cin >> &T[1];
    int * nextval = new int[Len2 + 1];
    GetNextVal(T, nextval);
    cout << "请输入开始匹配的位置（从1开始）：";
    cin >> pos;
    cout << IndexKMP(S, T, pos, nextval) << endl;
    delete []S;
    delete []T;
    delete []nextval;
    return 0;
}