HDU 2087 剪花布条【在字符串中不可重叠地寻找子串数量】

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define MAX 1000 + 10
using namespace std;

char a[MAX], b[MAX];
int p = 0;

int main()
{
    while ( scanf("%s", a), a[0] != ‘#‘) {
        getchar();
        scanf("%s", b);
        getchar();
        int ans = 0;
        char *pa = a, *pb = b;

        while ( strstr( pa, pb)) {
            ans ++;
            pa = strstr( pa, pb);
            if ( strlen( pa) == strlen( pb)) {
                break;
            }
            pa += strlen( pb);
        }
        printf("%d\n", ans);
    }


    return 0;
}

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define M 10010
#define N 1000010
char s1[M],s2[N];
int next1[N];
int sum;
void Nextll(int len2)
{
   int i=-1,j=0;
   next1[0]=-1;
   while(j<len2)
    {
       if(i==-1||s2[i]==s2[j])
       {
           ++i;
           ++j;
           next1[j]=i;
       }
       else
           i=next1[i];
    }
}
void Kmp(int len1,int len2)
{
   int i=0,j=0;
   sum=0;
   while(j<len1)
    {
       if(i==-1||s1[j]==s2[i])
       {
           ++i;
           ++j;
       }
       else
           i=next1[i];
       if(i==len2)
       {
           sum++;
           i=next1[i];
       }
    }
}
int main()
{
   while(~scanf("%s%s",s1,s2))
    {
        if((strcmp(s1,"#")==0)||(strcmp(s2,"#")==0))
                 break;
       int len1=strlen(s1);
       int len2=strlen(s2);
       Nextll(len1);
       Kmp(len1,len2);
       printf("%d\n",sum);
    }
   return 0;
}