字符串匹配KMP算法代码

#include<iostream>
#include<cstdio>
using namespace std;

const int maxm=10000;
const int maxn=1000000;

int nexttable[maxm];
int pattern[maxm];
int text[maxn];
void getnexttab(int m)
{
	int j=0;
	nexttable[j]=-1;
	int i=nexttable[j];
	while(j<m)
	{
		if(i==-1||pattern[j]==pattern[i])
		{
			i++;
			j++;
			nexttable[j]=i;
		}
		else
		{
			i=nexttable[i];
		}
	}

}
int kmp(int n,int m)
{
	getnexttab(m);
	int i=0;
	int j=0;
	while(i<n&&j<m)
	{
		if(j==-1||text[i]==pattern[j])
		{
			i++;
			j++;
		}
		else
		{
			j=nexttable[j];
		}
	}
	if(j==m)
	{
		return i-j+1;
	}
	else
	{
		return -1;
	}
	
}

int main()
{
	int casenumber;
	scanf("%d",&casenumber);
	while(casenumber--)
	{
		int n,m;
		scanf("%d%d",&n,&m);
		for(int i=0;i<n;++i)
		{
			scanf("%d",&text[i]);
		}
		for(int j=0;j<m;++j)
		{
			scanf("%d",&pattern[j]);
		}
		printf("%d\n",kmp(n,m));
	}
	return 0;
}