字符串匹配

最新推荐文章于 2024-10-08 20:32:22 发布

伊利达雷审判官

最新推荐文章于 2024-10-08 20:32:22 发布

阅读量51

点赞数

分类专栏：基础课打卡哦文章标签：算法

本文链接：https://blog.csdn.net/m0_57094519/article/details/120599127

版权

基础课打卡哦专栏收录该内容

17 篇文章 0 订阅

订阅专栏

利用map进行跳跃（不适用于太长的子字符串）【map存不下】【拉胯】

#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>

using namespace std;
int main()
{
    int n,m;
    string s,ss;
    cin>>n>>ss;
    cin>>m>>s;
    map<string ,int>mp;
    mp[ss]=-1;
    for (int i = 1; i <= n; i ++ )
    {
        ss.erase(n-i,1);
        //cout<<ss<<endl;
        mp[ss]=i;
    }
    for (int i = 0; i <= m-n; i ++ )
    {
        string sss="";
        for (int j = i; j < i+n; j ++ )
        sss+=s[j];
        while (1)
        {
            if(mp[sss]==-1)
            {
                cout<<i<<' ';
            }
            else if(mp[sss]>0)
            {
                i+=(mp[sss]-1);
                break;
            }
            sss.erase(0,1);
        }
    }
}

kmp算法

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
using namespace std;
char s[2000000],p[2000000];
int kmp[2000000];
int main()
{
    int n,m;
    cin>>n;cin>>p+1;
    cin>>m;cin>>s+1;
    int k=0;
    for (int i = 2; i <= n; i ++ )
    {
        while(k&&p[i]!=p[k+1])k=kmp[k];
        if(p[i]==p[k+1])k++;
        kmp[i]=k;
    }
    k=0;
    for (int i = 1; i <= m; i ++ )
    {
        while(k&&s[i]!=p[k+1])k=kmp[k];
        if(s[i]==p[k+1])k++;
        if(k==n)
        {
            cout<<i-n<<' ';
            k=kmp[k];
        }
    }
    
}

#include <iostream>
using namespace std;
const int N = 100010, M = 1000010;
int n, m;
int ne[N];
char s[M], p[N];
int main()
{
    cin >> n >> p + 1 >> m >> s + 1;
    //子串自我匹配
    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;
    }

    //举例abcab
    /*
    nx[1]=0;
    nx[2]=0;
    nx[3]=0;
    nx[4]=1;
    nx[5]=2;
    */

    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];
        }
    }
    //举例abcabcabe
    /*
    1 s[i] == p[j + 1]) j=1
    2 s[i] == p[j + 1]) j=2
    3 s[i] == p[j + 1]) j=3
    4 s[i] == p[j + 1]) j=4
    5 s[i] == p[j + 1]) j=5 j==n printf j=ne[5]=2;
    6 s[i] == p[j + 1]) j=3
    7 s[i] == p[j + 1]) j=4
    8 s[i] == p[j + 1]) j=5 j==n printf j=ne[5]=2;
    9 s[i] != p[j + 1])&&j j=nx[2]=0 
    */
    return 0;
}