KMP（未测试）

最新推荐文章于 2023-04-04 15:54:13 发布

寻找小海螺

最新推荐文章于 2023-04-04 15:54:13 发布

阅读量476

点赞数

分类专栏：数据结构和算法文章标签： KMP

本文链接：https://blog.csdn.net/czkct/article/details/49452803

版权

数据结构和算法专栏收录该内容

160 篇文章 1 订阅

订阅专栏

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int plen, slen;
const int MAXN = 1000;
int next[MAXN];

void getNext(char* p, int* next) {
	next[0] = -1;
	int k = -1;
	int j = 0; 
	while(j < plen) {
		if(k == -1 || p[j] == p[k]) {
			++j;
			++k;
			next[j] = k;
		}
		else {
			k = next[k];
		}
	}
}

int kmpSearch(char* s, char* p) {
	int i = 0; 
	int j = 0; 
	slen = strlen(s);
	plen = strlen(p);
	while(i < slen && j < plen) {
		if(j == -1 || s[i] == p[j]) {
			++i;
			++j;
		}
		else {
			j = next[j];
		}
	}
	if(j == plen) {
		return i - j;
	}
	else 
		return -1; 
} 

int main() {
	char a[100] = "asdfghjkdfghjkdafkdsjdioqweiruhkdjakfdafdkshdsjklajf";
	char b[100] = "jf";
	memset(next, 0, sizeof(next));
	getNext(b, next);
	int pos = kmpSearch(a, b);
	cout << "pos = " << pos << endl;
	return 0;
}

（上面的next数组还可以继续优化）---->>>>> 参考文章：http://blog.csdn.net/v_july_v/article/details/7041827 我是看这个学的

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int plen, slen;
const int MAXN = 1000;
int next[MAXN];

void getNext(char* p, int* next) {
	next[0] = -1;
	int k = -1;
	int j = 0; 
	while(j < plen) {
		if(k == -1 || p[j] == p[k]) {
			++j;
			++k;
		    if (p[j] != p[k])  
                next[j] = k;   //之前只有这一行  
            else  
                //因为不能出现p[j] = p[ next[j] ]，所以当出现时需要继续递归，k = next[k] = next[next[k]]  
                next[j] = next[k];
		}
		else {
			k = next[k];
		}
	}
}

int kmpSearch(char* s, char* p) {
	int i = 0; 
	int j = 0; 
	slen = strlen(s);
	plen = strlen(p);
	while(i < slen && j < plen) {
		if(j == -1 || s[i] == p[j]) {
			++i;
			++j;
		}
		else {
			j = next[j];
		}
	}
	if(j == plen) {
		return i - j;
	}
	else 
		return -1; 
} 

int main() {
	char a[100] = "asdfghjkdfghjkdafkdsjdioqweiruhkdjakfdafdkshdsjklajf";
	char b[100] = "jf";
	memset(next, 0, sizeof(next));
	getNext(b, next);
	int pos = kmpSearch(a, b);
	cout << "pos = " << pos << endl;
	return 0;
}