开开心心学算法--Binary String Matching

时间限制： 3000ms | 内存限制： 65535KB

难度： 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>

int main()
{
	int n,count;
	char a[10],b[1000],*p;
	scanf("%d",&n);
	
	while(n--)
	{
		count=0;
		scanf("%s%s",a,b);
		if(strlen(a)>strlen(b) || strlen(a)>10 ||strlen(b)>1000)
			return 0;
		p=b;
		while( (p=strstr(p,a)) !=NULL )
		{
			count++;
			p++;
		}
		printf("%d\n",count);
	}
	return 1;
}

运行时间0，内存228。