记录一下KMP实现

KMP的实现

---

没有过程的讲解,只是记录一下我的实现

KMP

---

KMP的代码实现:

str1 是字串
str2 是主串
查找目标串在主串中的第一次出现的位置:

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

char str1[200] = {0};
char str2[200] = {0};

int len1 = 0,len2 = 0;
int next[200] = {0};
void next_(){

	int i = 0,j = -1;

	next[0] = -1;
	while(i < len1){
		if(str1[i] == str1[j] || j == -1){
			++i;
			++j;
			next[i] = j;
		}
		else{
			j = next[j];
		}

	}

	return;
}

void kmp(){

	int i = 0,j = 0;
	next_();

	while(i < len2 && j < len1){

		if(str2[i] == str1[j] || j == -1){
			++i;
			++j;
		}
		else{
			j = next[j];
		}

	}
	if(j == len1){
		printf("%d\n",i-j);
		return;
	}
	else{
		printf("%d",-1);
		return;
	}
	return;
}
int main(){
	scanf("%s%s%*c",str1,str2);
	len1 = strlen(str1);//字串
	len2 = strlen(str2);//主串
	kmp();

	return 0;
}

查找目标串在主串中出现的次数:

void KMP_C() {
	int i = 0, j = 0, C = 0;

	next_();
	while (i < len2) {
		if (str1[j] == str2[i] || j == -1) {
			++i;
			++j;
		}

		else
			j = next[j];

		if (j == len1) {
		j = next[j];
			++C;
		}

	}
	printf("%d\n",C);
	return ;
}