Link:點擊打開鏈接
剪花布條
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21623 Accepted Submission(s): 13491
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
using namespace std;
char s1[1010],s2[1010];
int t[1010]; //神奇的是數組名改成next交上去直接CompileError
int KMP()
{
int i=0,j=0,c=0;
int a=strlen(s1);
int b=strlen(s2);
while(i<a)
{
if(j==-1||s1[i]==s2[j])
{
++i,++j;
if(j==b)
{
j=0;
c++;
}
}
else
j=t[j];
}
return c;
}
void getnext(char *s2,int m)
{
int i=0,j=0;
t[0]=-1;
j=t[i];
while(i<m)
{
if(j==-1||s2[i]==s2[j])
t[++i]=++j;
else
j=t[j];
}
}
int main()
{
while(~scanf("%s",s1)&&s1[0]!='#')
{
scanf("%s",s2);
int a=strlen(s1);
int b=strlen(s2);
getnext(s2,b);
printf("%d\n",KMP());
}
return 0;
}