KMP算法板子
数据结构最近在讲,所以把去年的存货拿出来
#include <stdio.h>
#define N 100100
#define M 1000100
int n,m;
char p[N],s[M];
int ne[N];
int main()
{
scanf("%d%s",&n,p + 1);
scanf("%d%s",&m,s + 1);
for(int i = 2,j = 0;i <= n; i ++)
{
while(j && p[i] != p[j + 1]) j = ne[j];
if(p[i] == p[j + 1]) j ++;
ne[i] = j;
}
for(int i = 1,j = 0;i <= m; i ++)
{
while(j && s[i] != p[j + 1]) j = ne[j];
if(s[i] == p[j + 1]) j ++;
if(j == n)
{
printf("%d ",i - n);
j = ne[j];
}
}
return 0;
}
看不懂的地方请调试,hin简单的思路,就是匹配与掉落
next计算
while( j && p[i] != p[j + 1] ) j = ne[j];
if(p[i] == p[j + 1]) j++;
ne[i] = j
kmp匹配计算
while( j && s[i] != p[j + 1] ) j = ne[j];
if(s[i] == p[j + 1]) j++;
if(j == n){
printf("%d",i - n);
j = ne[j];
}