#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<set>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
char a[1000005];
char b[1000005];
int next[1000005];
int n;
void getnext(){
int j=0,k=-1;
next[0]=-1;
while(j<strlen(b)-1){
if(k==-1||b[j]==b[k]){
next[++j]=++k;
}
else{
k=next[k];
}
}
}
int kj(){
int i=0,j=0;
while(i<strlen(a)){
if(j==-1||a[i]==b[j]) i++,j++;
else j=next[j];
if(j==strlen(b)) return i-strlen(b);
}
return -1;
}
int main(){
//freopen("5.in","r",stdin);
//freopen("5.out","w",stdout);
scanf("%s",&a);
scanf("%s",&b);
n=strlen(b);
getnext();
printf("%d",kj());
return 0;
}
kmp 模板
最新推荐文章于 2018-10-08 20:45:50 发布