831. KMP字符串
题目链接https://www.acwing.com/problem/content/833/
题目:
思路:推荐从1开始
大佬详细讲解https://www.acwing.com/solution/content/14666/
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=1e6+10;
char s[N],p[N];
int ne[N];
int main(){
int n,m;
cin>>n;
scanf("%s",p+1);
cin>>m;
scanf("%s",s+1);
for(int i=2,j=0;i<=n;i++){//注意是从第二个开始配对
while(j&&p[j+1]!=p[i]) j=ne[j];
if(p[j+1]==p[i]) j++;
ne[i]=j;
}
for(int i=1,j=0;i<=m;i++){
while(j&&p[j+1]!=s[i]) j=ne[j];
if(p[j+1]==s[i])j++;
if(j==n){
printf("%d ",i-j);
j=ne[j];
}
}
return 0;
}