kmp模板题
查找模式串在主串中出现的次数
代码如下:
#include <cstdio>
#include <cstring>
#define MAXW 10100
#define MAXT 1001000
using namespace std;
int next[MAXW];
char word[MAXW], text[MAXT];
void get_next(char p[]) {
int len = strlen(p);
int i = 0, j = -1;
next[0] = -1;
while(i < len) {
if(j==-1 || p[i]==p[j]) {
++i, ++j;
next[i] = j;
} else j = next[j];
}
}
int kmp(char t[], char s[]) {
int ans = 0;
int i = 0, j = 0;
int len1 = strlen(t);
int len2 = strlen(s);
get_next(s);
while(i < len1) {
if(j==-1 || t[i]==s[j]) {
++i, ++j;
} else j = next[j];
if(j == len2)
++ans;
}
return ans;
}
int main(void) {
int n;
scanf("%d", &n);
while(n--) {
scanf("%s%s", word, text);
printf("%d\n", kmp(text, word));
memset(next, 0, sizeof(next));
memset(word, 0, sizeof(word));
memset(text, 0, sizeof(text));
}
return 0;
}