ACM Binary String Matching （Java）

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

---

大概意思是给两个字符串A和B（B的长度永远大于A），问A在B中出现的次数，例如：A：1 1，B：1 0 0 1 1 1 0 1 1 0，那么A在B中出现过3次，分别为从B的下标（0开始）3、4和7开始的字符串“1 1”。

---

import java.util.Scanner;

public class BinaryStringMatching {
    static int result[];
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        sc.nextLine();
        result = new int[n];
        for (int i = 0; i < n; i++) {
            String A = sc.nextLine();
            String B = sc.nextLine();
            int len = A.length(); // A的长度
            int num = 0; // 符合条件的数目
            for (int j = 0; j <= B.length()-len; j++) {
                if(B.substring(j, j+len).equals(A)) num++;
            }
            result[i] = num;
        }
        for (int i = 0; i < result.length; i++)
            System.out.println(result[i]);
        sc.close();
    }

}

输入：
5
11
1001110110
101
110010010010001
1010
110100010101011
1100
01101100101100
00
000

输出：
3
0
3
2
2