【KMP】KMP算法模板

char t[N], p[M];int n, m, f[M];void get_f(){    f[0] = -1;    int i = 0, j = -1;    while(i < m) {        if(j == -1 || p[i] == p[j]) {            i++; j++;            f[i] = j;        }        else j = f[j];    }}int match(){    get_f();    int i = 0, j = 0, ans = 0;    while(i < n) {        if(j == -1 || t[i] == p[j]) {            i++; j++;            if(j == m) {                ans++;                j = f[j];            }        }        else j = f[j];    }    return ans;}