kmp算法的c++实现(不用STL)

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int nMax = 10005;
const int mMax = 1000005;
char text[mMax],pat[nMax];
int lent,lenp,next[nMax];
void get_next()
{
    int i,j = -1;
    next[0]=-1;
    for(i=0;i<lenp;i++)
    {
        while(j>-1&&pat[j+1]!=pat[i])
            j=next[j];
    next[i]=j;
    }
}
int KMP()
{
    int ans=0,i=0,j=-1;
    get_next();
    for(i=0;i<lent;i++)
    {
        while(j!=-1&&pat[j+1]!=text[i])
        {
            j=next[j];
        }
        if(pat[j+1]==text[i])
            j=j+1;
        if(j==lenp-1)
            ans++;
    }
    return ans;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s%s",pat,text);
        lenp=strlen(pat);
        lent=strlen(text);
        printf("%d\n",KMP());
    }
    return 0;

}