求一个字符串里含有的子字符串的数量

点击打开链接

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 

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	int t,m,n,i,j,k,ans;
	char ch1[1005];			//母序列 
	char ch2[105];			//子序列 
	scanf("%d",&t);
	getchar();
	while(t--)
	{
		ans=0;
		scanf("%s %s",ch2,ch1);
		m=strlen(ch1);
		n=strlen(ch2);
		for(i=0; i<=m-n; i++)
		{
			if(ch1[i] == ch2[0])	//如果相等 
			{
				for(j=1; j<n; j++) 	//判断字符串的下一个序列 
				if(ch1[i+j] != ch2[j])//如果不相等，从新判断 
				break;
				if(j>=n)
				ans++;	
			}
		}
		printf("%d\n",ans);	
	}
	return 0;
}