模板——KMP

 

资料 ：https://blog.csdn.net/starstar1992/article/details/54913261/

#include <bits/stdc++.h>
using namespace std;
void cal_next(char *str, int *Next, int len) //下标必须是从0开始
{
	Next[0] = -1;
	int k = -1;
	for (int i = 1; i <= len-1; i++)
	{
		while (k > -1 && str[k + 1] != str[i])
			k = Next[k];
		if (str[k + 1] == str[i])
			k++;
		Next[i] = k;
	}
}
int KMP(char *str, int slen, char *ptr, int plen)
{
	int Next[100];
	cal_next(ptr, Next, plen);
	int k = -1;

	for (int i = 0; i < slen; i++) {
		while (k > -1 && ptr[k + 1] != str[i])
			k = Next[k];
		if (ptr[k + 1] == str[i])
			k++;
		if (k == plen-1) return i - plen + 1;
	}
	return -1;
}
int main()
{
	char str[1000], ptr[1000];
	cin >> str >> ptr;
	int ans = KMP(str,strlen(str), ptr, strlen(ptr));
	if (ans == -1) cout << "no find!" << endl;
	else cout << ans << endl;
	return 0;
}