KMP算法

KMP算法

再此记录一下自己写的KMP算法代码，防止以后忘记。

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

int *get_next(char *pattern)
{
	int n=strlen(pattern);
	int *next=new int[n];
	next[0]=0;
	int len=0;
	int i=1;
	while(i<n)
	{
		if(pattern[i]==pattern[len]) 
		{
			len++;
			next[i]=len;
			i++;
		}
		else
		{
			if(len>0) len=next[len-1];
			else
			{
				next[i]=len;
				i++;
			}
		}
	}
	for(int i=n-1;i>0;i--) next[i]=next[i-1];
	next[0]=-1;
	return next;
}

void KMP_Match(char *pattern,char *test)
{
	int n=strlen(test);
	int m=strlen(pattern);
	int *next=get_next(pattern);
	int i=0,j=0;
	while(i<n)
	{
		if(j==m-1 && pattern[j]==test[i]) 
		{
			for(int t=0;t<=i-m;t++) cout<<" ";
			cout<<pattern<<endl;
		}
		if(pattern[j]==test[i]) i++,j++;
		else
		{
			j=next[j];
			if(j==-1) i++,j++;
		}
	}
}

int main()
{
	char pattern[]="ABABCABAA";
	char test[]="ACBAAABABCABAAACABABABCABAAAB";
	cout<<test<<endl;
	KMP_Match(pattern,test);
	return 0;
}