Binary String Matching
时间限制:
3000 ms | 内存限制:
65535 KB
难度:
3
-
描述
-
Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as a substring of B? For example, the text string B is ‘1001110110’ while the pattern string A is ‘11’, you should output 3, because the pattern A appeared at the posit
-
输入
- The first line consist only one integer N, indicates N cases follows. In each case, there are two lines, the first line gives the string A, length (A) <= 10, and the second line gives the string B, length (B) <= 1000. And it is guaranteed that B is always longer than A. 输出
- For each case, output a single line consist a single integer, tells how many times do B appears as a substring of A. 样例输入
-
3 11 1001110110 101 110010010010001 1010 110100010101011
样例输出
-
3 0 3
数据量比较小, 枚举
import java.io.BufferedInputStream;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(new BufferedInputStream(System.in));
int N = cin.nextInt();
for (int i = 0; i < N; i++) {
String a = cin.next().trim();
String b = cin.next().trim();
System.out.println(process(a, b));
}
cin.close();
}
private static int process(String key, String string) {
int kLen = key.length() - 1;
int kIndex = kLen;
int result = 0;
for (int i = kLen; i < string.length(); i++) {
int j = i;
while (kIndex >= 0) {
if (key.charAt(kIndex) != string.charAt(j)) {
break;
}
kIndex--;
j--;
}
if (kIndex < 0) {
result++;
}
kIndex = kLen;
}
return result;
}
}