【南阳】字符串匹配

最新推荐文章于 2023-11-06 16:56:22 发布

原创最新推荐文章于 2023-11-06 16:56:22 发布 · 370 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

本渣渣水过的题||--

当前文章被收录于：

本渣渣水过的题||--

28 篇文章 0 人学习

订阅专栏查看详情

----------字符串----------

当前文章被收录于：

----------字符串----------

17 篇文章 0 人学习

订阅专栏查看详情

NY OJ

当前文章被收录于：

NY OJ

10 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

本文介绍了一种解决二进制字符串匹配问题的算法实现，该算法能够高效地计算一个二进制字符串作为子串在另一个较长的二进制字符串中出现的次数。

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<cstdio>
#include<algorithm>
using namespace std;
#include<cstring>
char s1[10];
char s2[1000];
int main(){
	int t,j;
	scanf("%d",&t);
	while(t--){
		int num=0;
		scanf("%s %s",s1,s2);
		int l1=strlen(s1);
	int l2=strlen(s2);
	for(int i=0;i<=l2-l1;i++){
		for(j=0;j<l1;j++){
			if(s2[i+j]!=s1[j])//出现不匹配 
			break;
		}
				if(j>=l1) num++;
	}
	printf("%d\n",num);
	}
	
}