int kmp(char S[],char T[],int Next[],int S_length,int T_length)
{
int i=0;
int j=0;
while (i<S_length&&j<T_length)
{
if (j==-1||S[i]==T[j])
{
i++;
j++;
}
else
{
j=Next[j];
}
}
if (j>=T_length)
{
return i-T_length;
}
else
return -1;
}
void get_next(int next[],char T[],int length)
{
if (length<1)
{
return;
}
next[0]=-1;
int j=-1;
int i=0;
while (i<length-1) //主串的下标
{
if (j==-1||T[i]==T[j])
{
i++;
j++;
if(T[i]==T[j])
{
next[i]=next[j];
}
else
{
next[i]=j;
}
}
else
j=next[j];
}
}
int main()
{
char s[13]={'a','a','b','b','a','b','c','a','b','d','a','b','c'};
char pattern[6]={'a','b','c','a','b','d'};
int next[6];
get_next(next,pattern,6);
for (int i=0;i<6;i++)
{
cout<<next[i]<<endl;
}
int index=kmp(s,pattern,next,13,6);
cout<<"位置是:"<<index<<endl;
system("pause");
return 0;
}