POJ 3461 KMP

题意求模式串在主串中出现的次数

题解：
1. KMP匹配
2. 匹配完成后移位为串尾的next值

code:

#include <cstdio>
#include <cstring>
using namespace std;

const int N = 1000010;
const int M = 10010;
char S[N], T[M];
int Next[M], len1;

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

int kmp(){
    int i = 0, j = 0, ans = 0;
    while(S[i]){
        if(j == -1 || S[i] == T[j]) ++i, ++j;
        else j = Next[j];
        if(j == len1){/**匹配到模式串尾, 移位next[len1]继续匹配*/
            ++ans; j = Next[j];
        }
    }
    return ans;
}

int main(){

    int t;
    scanf("%d", &t);
    while(t--){
        scanf("%s%s", T, S);
        len1 = strlen(T);
        getNext();
        printf("%d\n", kmp());
    }
    return 0;
}