使用块链结构实现修正的KMP匹配算法

修正的KMP匹配算法为：（这是一整个程序，希望高手帮帮忙，万分感激 ）
#include <stdio.h>
#include <string.h>
#include <time.h>
#define SLen 100
#define TLen 30

int KMP(char *S,char *T,int n)
{
int i=1,j=0,nextval[TLen+1],l,p,q=0;
p=n;
nextval[0]=0;
nextval[1]=0;
while(i <TLen)
{
if(j==0||(*(T+i-1)==*(T+j-1)))
{
++i;++j;
if((*(T+i-1)!=*(T+j-1)))nextval[i]=j;
else nextval[i]=nextval[j];
}
else j=nextval[j];
}
for(l=1;l <TLen+1;l++)
printf("nextval[%d]=%d\n",l,nextval[l]);
while((p <=SLen)&&(q <=TLen))
{
if(q==0||(*(S+p-1)==*(T+q-1)))
{
++p;++q;
}
else q=nextval[q];
}
if(q>TLen)return(p-TLen);
else return(0);
}

void main()
{
clock_t start, finish;
double duration;
start = clock(); //计时开始

int pos,k;
char S[SLen],T[TLen];
printf("Please input SString S[%d]:\n",SLen);
scanf("%s",S);
printf("Please input SString T[%d]:\n",TLen);
scanf("%s",T);
printf("Please input pos:\n");
scanf("%d",&pos);
k=KMP(S,T,pos);
printf("\nThe position of SString T in SString S after %d numbers is:%d.\n",pos,k);


finish = clock();
printf( "Time to do this test is: \n ");
duration = (double)(finish - start) / CLOCKS_PER_SEC;
printf( "%f seconds\n", duration ); //计时结束

}

不知道你要问啥

如果要代码，看这个！

#include <stdio.h>
#include <string.h>

#define MAXLEN 256
int next[MAXLEN];

void KMP(char* S, char* T)
{
int i, j, n, m;

m = strlen(T);
i = 1; j = 0;
next[0] = 0;
while(i < m) {
if(T[i] == T[j]) {
next[i++] = ++j;
} else if(j > 0) {
j = next[j-1];
} else {
next[i++] = 0;
}
}

i = j = 0;
n = strlen(S);
while(i < n) {
if(S[i] == T[j]) {
++j;
if(j == m) {
printf("pos %d\n", i-m+1);
}
++i;
} else if(j > 0) {
j = next[j-1];
} else
++i;
}
}

int main()
{
KMP("acabaacabacacbacabbc", "aca");
getchar();
return 0;
}