KMP简单模板

最新推荐文章于 2022-06-02 15:18:30 发布

除以零_

最新推荐文章于 2022-06-02 15:18:30 发布

阅读量195

点赞数

分类专栏：模板

本文链接：https://blog.csdn.net/SuperBvs/article/details/86554670

版权

模板专栏收录该内容

30 篇文章 0 订阅

订阅专栏

例题是 Oulipo

题意是问主串中模式串出现啦多少次。属于简单KMP的应用，使用扩展KMP，实现计数即可。特此记录下KMP的模板方便以后使用。

/*
 * Do not go gentle into that good night
 *                                    ----Dylan Thomas
 * Author:  looooop
 * Created Time:  2019年01月19日 星期六 16时17分21秒
 * File Name: Oulipo.cpp
 */
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <time.h>

using namespace std;
#define lson 2*i
#define rson 2*i+1
#define LS l,mid,lson
#define RS mid+1,r,rson
#define UP(i,x,y) for(i=x;i<=y;i++)
#define DOWN(i,x,y) for(i=x;i>=y;i--)
#define MEM(a,x) memset(a,x,sizeof(a))
#define gcd(a,b) __gcd(a,b)
#define LL long long
#define N 1000005
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define EXP 1e-8
#define lowbit(x) (x&-x)
#define MAX 1000006
const int maxint = -1u>>1;
char text[MAX];char pattern[MAX];
int T;int ans;
int Next[MAX];
void getNext(char x[]) {        //求Next数组，传参传入模式串。
    int j,k;
    j = 0; k = -1; Next[0] = -1;
    int length_x = strlen(x);
    while(j < length_x) {
        if(k == -1 || x[j] == x[k])
            Next[++j] = ++k;
        else
            k = Next[k];
    }
}
int KMP_Count(char pattern[],char text[]) {         //KMP_Count计算主串中有多少的模式串，传入参数pattern(模式串),text(主串)
    int ans = 0;
    int i,j = 0;
    int length_pattern = strlen(pattern);
    int length_text = strlen(text);
    if(length_pattern == 1 && length_text == 1) {
        if(pattern[0] == text[0])
            return 1;
        else
            return 0;
    }
    getNext(pattern);
    for( i = 0; i < length_text; i++) {
        while(j>=0 && text[i] != pattern[j])
            j = Next[j];
        if(j == -1||text[i] == pattern[j])
            j++;
        if(j == length_pattern) {
            ans++;
            j = Next[j];
        }
    }
    return ans;
}
int KMP_Index(char pattern[],char text[]) {
    int i = 0,j = 0;
    getNext(pattern);
    int length_pattern = strlen(pattern);
    int length_text = strlen(text);
    while(i < length_text && j < length_pattern) {
        if(j == -1 || text[i] == pattern[j]) {
            i++;
            j++;
        }
        else
            j = Next[j];
    }
    if(j == length_pattern)
        return i-length_pattern;
    else
        return -1;
}
int main(int argc,char *argv[]) {
    scanf("%d",&T);
    while(T--) {
        scanf("%s",pattern);
        scanf("%s",text);
        ans = KMP_Count(pattern,text);
        printf("%d\n",ans);
    }
    return 0;
}