NYOJ-----5---Binary String Matching（KMP）

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 

判断长串中有几个短串，暴力貌似也可以，不过KMP更明显一点

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<set> 
#include<stack>
#include<queue>
#include<vector>
#include<functional>
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define CL(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int maxn = 1e5+10;
const int MOD = 1e9+7;
char s[maxn], l[maxn];
int L, S, ans;
int next[maxn];
void get_next(){
	int i, j;
	i = 0;
	next[0] = j = -1;
	while(i < S-1){
		if(j == -1 || s[i] == s[j]){
			i++;
			j++;
			next[i] = j;
		}
		else j = next[j];
	}
}
void get_match(){
	int i, j;
	i = j = 0;
	while(i < L){
		if(j == -1 || l[i] == s[j]){
			i++;
			j++;
		}
		else j = next[j];
		if(j == S){
			ans++;
			i = i-S+1;
			j = 0;
		}
	}
}
int main(){
	int t, n;
	scanf("%d", &t);
	while(t--){
		ans = 0;
		scanf(" %s%s", s, l);
		L = strlen(l); S = strlen(s);
		get_next(); get_match();
		printf("%d\n", ans);
	}
	return 0;
}