KMP的变型
#include<iostream>
#include<string>
#include<cstdio>
#define N 10000
using namespace std;
int Next[N];
void getnextval(string T);
int KMP(string S, string T);
int main()
{
int n;
cin >> n;
string S, T;//S为文本串,T为模式串
while (n--)
{
cin >> T >> S;
getnextval(T);
printf("%d\n", KMP(S, T));
}
}
void getnextval(string T)
{
int i = 0;//i不会后退
Next[i] = -1;
int j = Next[i];
while (i < T.size())
{
if (j == -1 || T[i] == T[j])
{
i++;
j++;
if (T[i] != T[j])
Next[i] = j;
else
Next[i] = Next[j];
}
else
{
j = Next[j];
}
}
}
int KMP(string S, string T)
{
int k = 0;
int i = 0;//i不会后退
int j = 0;//j表示模式串
int m = S.size();
int n = T.size();
getnextval(T);
while (i < m)
{
if (j==-1||S[i] == T[j])
{
i++;
j++;
}
else
{
j = Next[j];
}
if (j == n)
{
k++;
j = Next[j];
}
}
return k;
}