好歹也是我b哥的主讲内容,怎么能不熟练掌握???
最弱智板子之poj3461 求a串在b串的出现次数。
//poj 3461 by B_LL2016
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
using namespace std;
int n,m;
int Next[1000005];
char s[1000005],s1[1000005];
void setNext()
{ int i,j,k;
i=0; j=-1; Next[0]=-1;
k=strlen(s);
while(i<k)
{ if(j==-1 || s[i]==s[j])
{ i++; j++;
Next[i]=j;
} else j=Next[j];
}
return ;
}
int kmp()
{ int i,j,ans=0;
i=j=0;
setNext();
int len1=strlen(s1),len=strlen(s);
while(i < len1) {
if(j == -1 || s1[i] == s[j]) ++i, ++j;
else j = Next[j];
if(j == len) ans++;
}
return ans;
}
int main()
{ int i,t;
scanf("%d",&t);
while(t>0)
{ t--;
scanf("%s %s",s,s1);
printf("%d\n",kmp());
}
return 0;
}