题意:给定一个模板串,问该字符串在文本串出现的次数。
KMP算法水过。。
代码如下:
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
const int maxn = 1e5+10;
char text[maxn],p[maxn];
int Next[maxn];
int len;
int ans;
void get_next(){
Next[0] = Next[1] = 0;
len = strlen(p);
int j = 0;
for (int i=1; i<len; i++) {
while (j && p[j]!=p[i]) j = Next[j];
if (p[j]==p[i]) j++;
Next[i+1] = j;
}
}
void solve(){
ans = 0;
int j = 0;
int n = strlen(text);
for (int i=0; i<n; i++) {
while (j && text[i]!=p[j]) j = Next[j];
if (text[i]==p[j]) j++;
if (j==len) {ans++; j = 0;}
}
}
int main(){
while (scanf("%s%s",text,p)!=EOF){
get_next();
solve();
printf("%d\n",ans);
}
return 0;
}