Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 28598 Accepted Submission(s): 17500
Problem Description
一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢?
Input
输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见#字符,则不再进行工作。
Output
输出能从花纹布中剪出的最多小饰条个数,如果一块都没有,那就老老实实输出0,每个结果之间应换行。
Sample Input
abcde a3 aaaaaa aa #
Sample Output
0 3
import java.util.*;
public class Main
{
public static int [] makeNext(char a[])
{
int len = a.length;
int j = 0;
int next[] = new int [len];
for(int i = 1;i<len;i++)
{
while(j > 0 && a[i] != a[j])
{
j = next[j - 1];
}
if(a[i] == a[j])
{
j++;
}
next[i] = j;
}
return next;
}
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
while(sc.hasNext())
{
String str1 = sc.next();
if(str1.charAt(0) == '#')
{
break;
}
String str2 = sc.next();
if(str2.length() > str1.length())
{
System.out.println("0");
//continue;
}
char a1[] = new char[str1.length()];
char a2[] = new char[str2.length()];
for(int i = 0;i < a1.length;i++)
{
a1[i] = str1.charAt(i);
}
for(int i = 0;i < a2.length;i++)
{
a2[i] = str2.charAt(i);
}
int next[] = makeNext(a2);
int j = 0;
int res = 0;
for(int i = 0;i < a1.length;i++)
{
char ch1 = a1[i];
char ch2 = a2[j];
if(ch1 != ch2)
{
if(j != 0)
{
j = next[j - 1];
i--;
continue;
}
else
{
continue;
}
}
if(j == a2.length - 1)
{
res++;
j = 0;
continue;
}
j++;
}
System.out.println(res);
}
}
}