剪花布條
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10399 Accepted Submission(s): 6701
#include <stdio.h>
#include <string.h>
#define SIZE 1100
char t[SIZE] , des[SIZE] ;
int next[SIZE] ;
void getNext()
{
int len = strlen(t) ;
int i = -1 , j = 0 ;
next[0] = -1 ;
while(j<len)
{
if(i == -1 || t[i] == t[j])
{
++i,++j;
next[j] = i ;
}
else
{
i = next[i] ;
}
}
}
int kmp()
{
int i = 0 , j = 0 ;
int len1 = strlen(t) , len2 = strlen(des) ;
int c = 0 ;
getNext() ;
while(j<len2)
{
if(i == -1 || t[i] == des[j])
++i ,++j;
else
i = next[i] ;
if(i == len1)
{
i = 0 ;
c++ ;
}
}
return c ;
}
int main()
{
while(~scanf("%s",des) && strcmp(des,"#")!=0)
{
scanf("%s",t) ;
int ans = kmp() ;
printf("%d\n",ans) ;
}
return 0 ;
}
與君共勉