字符串匹配算法 KMP

#include<stdio.h>
//串的定长顺序存储表示
#define MAXSTRLEN 50  // // 用户可在50以内定义最大串长
#define  MAXLEN 255
typedef struct{
char ch[MAXLEN+1];
int length;
}SString;
char   next[MAXLEN];

int indexBF(SString S, SString T, int pos){
	int i = pos, j = 1;
	while(i <= S.length && j <= T.length){
		if(j==0||S.ch[i]==T.ch[j]){
			i++;
			j++;
		}else{
			j = next[j];
		}
	if(j>T.length)  return i-T.length;
	else   return 0;
}
}
void  getnext(SString  T,int next[]){
	int i,j;
i=1;
next[1]=0;
j=0;
while(i<T.length)
{
if(j==0||T.ch[i]==T.ch[j]){
	++i;++j;
	next[i]=j;
}
else  j=next[j];
}
}
void init(SString &S, char str[]){
	int i = 0;
	while(str[i]!='\0'){
		S.ch[i+1] = str[i];
		i++;
	}
	S.ch[i+1] = '\0';
	S.ch[0] = i;
}
void printStr(SString Str){
	for(int i = 1; i <= Str.ch[0]; i++){
		printf("%c", Str.ch[i]);
	}
	printf("\n");
}
void main(){
	SString S ;
	init(S, "ababcabcacbab");
	printStr(S);
	SString T;
	init(T, "abcac");
	printStr(T);
	int index = indexBF(S, T, 1);
	printf("index is %d\n", index);
}

程序运行结果：