剪花布條
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21575 Accepted Submission(s): 13467
題解:KMP算法的基本應用。如果對KMP算法不太熟悉,可以看一下這篇博文:點擊打開鏈接
代碼如下:
#include<cstdio>
#include<cstring>
char T[1005],P[1005];
int Next[1005];
int n,m;
int num;
void Get_Next(){
int q,k=0;
Next[0]=0;
for(q=1;q<m;q++){
while(k>0&&P[q]!=P[k])
k=Next[k-1];
if(P[q]==P[k])
k++;
Next[q]=k;
}
}
void Kmp(){
int i,q=0;
for(i=0;i<n;i++){
while(q>0&&T[i]!=P[q])
q=Next[q-1];
if(P[q]==T[i])
q++;
if(q==m){
num++;
q=0;
}
}
}
int main()
{
while(~scanf("%s",T)){
if(T[0]=='#') break;
scanf("%s",P);
memset(Next,0,sizeof(Next));
n=strlen(T);
m=strlen(P);
num=0;
Get_Next();
Kmp();
printf("%d\n",num);
}
return 0;
}