#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
const int N = 10010, M = 100010;
int n, m;
char p[N], s[M];
int ne[N];
int main() {
freopen("in.txt", "r", stdin);
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf(" %c", &p[i]);
scanf("%d", &m);
for (int i = 1; i <= m; i++) scanf(" %c", &s[i]);
//求next的过程
for (int i = 2, j = 0; i <= n; i++) {
while (j && p[i] != p[j + 1]) j = ne[j];
if (p[i] == p[j + 1]) j++;
ne[i] = j;
}
//kmp 匹配过程
for (int i = 1, j = 0; i <= m; i++) {
while (j && s[i] != p[j + 1]) j = ne[j];
if (s[i] == p[j + 1]) j++;
if (j == n) {
printf("%d ", i - n);
j = ne[j];
}
}
return 0;
}
#include<stdio.h>
const int N = 10010,M =100010;
char q[N], s[M];
int ne[N];
int main() {
freopen("in.txt", "r", stdin);
int n, m;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf(" %c", &q[i]);
scanf("%d", &m);
for (int i = 1; i <= m; i++) scanf(" %c", &s[i]);
//标记next数组,
for (int i = 2,j = 0; i <= n; i++) {
while (j && q[i] != q[j + 1]) j = ne[i];
if (q[i] == q[j + 1]) j++;
ne[i] = j;
}
for (int i = 1, j = 0; i <= m; i++) {
while (j && s[i] != q[j + 1]) j = ne[i];
if (s[i] == q[j + 1]) j++;
if (j == n) {
printf("%d", i - n);
j = ne[j];
}
}
return 0;
}
输出 : 7
C语言输出结果
C++输出结果