剪花布条 - HDU 2087（简单KMP | 暴力）

分析：基础的练习...............

=======================================================================================

#include<stdio.h>
#include<string.h>

const int MAXN = 1e4+;

void GetNext(char s[], int next[], int N)
{
    int i=, j=-;

    while(i<N)
    {
        if(j==- || s[i]==s[j])
            next[++i] = ++j;
        else
            j = next[j];
    }
}
int KMP(char a[], char b[])
{
    int i=, j=, ans=, next[MAXN]={-};
    int Na=strlen(a), Nb=strlen(b);

    GetNext(b, next, Nb);

    while(i < Na)
    {
        while(j==- || (a[i]==b[j] && i<Na) )
            i++, j++;

        if(j == Nb)
            j=, ans++;
        else
            j = next[j];
    }

    return ans;
}

int main()
{
    char a[MAXN], b[MAXN];

    while(scanf("%s", a), strcmp(a, "#"))
    {
        scanf("%s", b);

        printf("%d\n", KMP(a, b));
    }

    return ;
}