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 

注 - 此题为 ：  NYOJ 5 Binary String Matching  (KMP)

说明： 求母串中子串个数， KMP  模板

已AC代码：

#include<cstdio>
#include<cstring>
#define MAX 2000

char ch1[MAX],ch2[MAX];
int p[MAX],len1,len2,cnt;

void getp()
{
	int i=0,j=-1;
	p[0]=-1;
	while(i<len1)
	{
		if(j==-1||ch1[i]==ch1[j])
		{
			i++,j++;
			p[i]=j;
		}
		else
		j=p[j];
	}
}
void KMP()
{
	getp();
	int i=0,j=0;
	while(i<len2)
	{
		if(j==-1||ch2[i]==ch1[j])
		{
			i++,j++;
			if(j==len1)
				cnt++;
		}
		else
			j=p[j];
	}
}

int main()
{
	int N;
	scanf("%d",&N);
	while(N--)
	{
		scanf("%s%s",ch1,ch2);
		len1=strlen(ch1);
		len2=strlen(ch2);
		cnt=0;
		KMP();
		printf("%d\n",cnt);
	}
	return 0;
}