STL--string练习

最新推荐文章于 2025-02-09 17:25:16 发布

原创最新推荐文章于 2025-02-09 17:25:16 发布 · 788 阅读

0 ·

CC 4.0 BY-SA版权

ACM_水题专栏收录该内容

22 篇文章

订阅专栏

本文介绍了一个基于KMP算法的二进制字符串匹配问题，旨在解决如何计算一个由'0'和'1'组成的字符串A作为子串出现在另一个较长字符串B中的次数。通过具体的示例和代码实现，展示了如何高效地进行字符串匹配。

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

/**********************
* author:crazy_石头
* Pro:HDOJ 1711
* algorithm: KMP
* Judge Status:Accepted
***********************/
#include <iostream>
#include <string>
using namespace std;

int main()
{
	int N,pos,count;
	string A,B;
	cin>>N;
	while(N--)
	{
	    cin>>A>>B;
		count=pos=0;
		while(pos=B.find(A.c_str(),pos),pos!=string::npos)
		{
			count++;
			pos++;
		}
		cout<<count<<endl;
	}
	return 0;
}