kmp未优化练习

仰望蓝天xz

于 2020-09-24 23:00:32 发布

阅读量118

点赞数

CC 4.0 BY-SA版权

文章标签： kmp

本文链接：https://blog.csdn.net/qq_41360176/article/details/108785495

#include <iostream>
#include <stdio.h>
#include <string>
#include <cstring>
#include <set>
#include <math.h>
using namespace std;

int nex[3000];
char s1[3000],s2[3000];

void getnex(char s[])
{
    memset(nex,0,sizeof nex);
    int i=0,j=-1,len=strlen(s);
    nex[0]=-1;
    while(i<len){
        while(j!=-1 && s[i]!=s[j])j=nex[j];
        nex[++i]=++j;
    }
//    for(int i=0;i<len;i++){
//        cout<<nex[i]<<" ";
//    }cout<<endl;
}

int kmp(char s1[], char s2[])
{
    getnex(s2);
    int ans=0;
    int len1=strlen(s1),len2=strlen(s2);
    int i=0,j=0;
    while(i<len1){
        if(j==len2-1 && s1[i]==s2[j]){
//            cout<<i<<" "<<j<<endl;
            ans++;j=-1;
        }
//        cout<<i<<" "<<j<<endl;
        if(j!=-1 && s1[i]!=s2[j])j=nex[j];
        else ++i,++j;
    }
    return ans;
}

int main()
{
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    while(~scanf("%s",&s1)&&s1[0]!='#'){
        scanf("%s",&s2);
        printf("%d\n",kmp(s1,s2));

    }

    return 0;
}