算法.kmp

最新推荐文章于 2024-09-12 19:02:20 发布

丰海洋

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量284

点赞数 2

分类专栏：算法文章标签：算法 c++ java

本文链接：https://blog.csdn.net/2301_79724443/article/details/135941429

版权

算法专栏收录该内容

19 篇文章 0 订阅

订阅专栏

#include<iostream>
using namespace std;
const int N = 10010, M = 100010;
int n, m, ne[N];
char p[N], s[M];
int main()
{
    cin >> n >> p + 1 >> m >> s + 1;
    for (int i = 2, j = 0; i <= n; i++)
    {
        while (p[j + 1] != p[i])j = ne[j];
        if (p[j + 1] == p[i])j++;
        ne[i] = j;
       
    }
    for (int i = 1, j = 0; i <= m; i++)
    {
        while (p[j + 1] != s[i])j = ne[j];
        if (p[j + 1] == p[i])j++;
        ne[i] = j;
        if (n == j)
        {
            cout << i - n;
            j = ne[j];
        }

    }

    return 0;
}

kmp这仨人真聪明