hdoj 1686 Oulipo

题目链接：Oulipo

题目链接：给你模式串和原串，问模式串在原串中出现的次数

题目思路：直接KMP就好

#include <bits/stdc++.h>

using namespace std;
const int maxn = 1e6+10;

int Next[maxn];
char str[maxn],mo[maxn];

void getNext(){
    int i = 0,j = -1,len = strlen(mo);
    while(i < len){
        if(j == -1||mo[i] == mo[j])
            Next[++i] = ++j;
        else j = Next[j];
    }
}

int kmp(){
    int i = 0,j = 0,l1 = strlen(str),l2 = strlen(mo);
    int ans = 0;
    while(i < l1){
        if(j == -1||mo[j] == str[i])
            i++,j++;
        else j = Next[j];
        if(j == l2) ans++;
    }
    return ans;
}

int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%s%s",mo,str);
        Next[0] = -1;
        getNext();
        printf("%d\n",kmp());
    }
    return 0;
}