Output輸出能從花紋布中剪出的最多小飾條個數,如果一塊都沒有,那就老老實實輸出0,每個結果之間應換行。
Sample Input
abcde a3 aaaaaa aa #Sample Output
0 3
KMP的簡單運用
題意:判斷A字符串有多少個B
#include <iostream>
#include <cstdio>
#include <cstring>
char str1[1000],str2[1000];
int next[1000];
int main()
{
while(~scanf("%s",str1))
{
if(str1[0] == '#')
return 0;
scanf("%s",str2);
int l1 = strlen(str1);
int l2 = strlen(str2);
int i=0 , j = -1;
next[0] = -1;
while( i < l2)
{
if(j == -1 || str2[i] == str2[j])
{
i++;
j++;
next[i] = j;
}
else
{
j = next[j];
}
}
// for(int i = 0; i< l2; i++)
// printf("%d ",next[i]);
int p = 0 , q = 0;
int ans = 0;
while(p < l1)
{
if( q == -1 || str1[p] == str2[q])
{
p++;
q++;
if(q == l2)
{
ans++;
q = 0;
}
}
else
{
q = next[q];
}
}
printf("%d\n",ans);
}
return 0;
}