kmp算法 ---- C语言

#include<stdio.h>
#include<string.h>
#define MAX 100
void kmp(char source[MAX],char pattern[MAX],int next[MAX]);
void getnext(char pattern[MAX],int next[MAX]);
int searchnext(char pattern[MAX],int next[MAX],int right,int left);
int main() {
int next[MAX] = {-1,0};
char source[MAX] = "bbcabcdababcdabcdabde";
char pattern[MAX] = "abcdabd";
getnext(pattern,next);
kmp(source,pattern,next);
return 0;
}

void kmp(char source[MAX],char pattern[MAX],int next[MAX]) {
int i = 0,j = 0;
while(i < strlen(source)&&j < strlen(pattern)) {
	if(source[i] == pattern[j]) {
		i++;
		j++;
	} else {
		i = i - next[j];
		j = 0;
	}
}
printf("%d",i - strlen(pattern));
}

void getnext(char pattern[MAX],int next[MAX]) {
int i = 0;
for(i = 2;i < strlen(pattern); i++) {
	if(pattern[i - 1] == pattern[next[i - 1]])   next[i] = next[i - 1] + 1;
	else next[i] = searchnext(pattern,next,i - 1,next[i - 1]);
}
}

int searchnext(char pattern[MAX],int next[MAX],int right,int left){
if(pattern[right] == pattern[left]) return left;
else{
	if(left == 0) return 0;
	left = next[left];
	searchnext(pattern,next,right,left);
}
}