NYOJ5——Binary String Matching
2024-08-30 12:31:04
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<iostream>//我用模式匹配算子串出现的次数
#include<string>
using namespace std; int Match(string pat,string sat)
{
int count=;
int i=;
int m=pat.length(),n=sat.length();
while(i<=(n-m))
{
int j=;
while((sat[i]==pat[j])&&(j<pat.length()))
{
i++;
j++; }
if(j==pat.length())
{
count++;
}
i=i-j+;
} return count;
}
int main()
{ int num;
cin>>num;
string pat,sat;
while(num--)
{
int p=,s=;
int count;
cin>>pat;
cin>>sat; count=Match(pat,sat);
cout<<count<<endl;
} return ;
}
最新文章
- 分享几个原生javascript面向对象设计小游戏
- Robotium自动化测试框架实用教程(图)
- PHP单引号和双引号的区别
- MongoDB的find用法
- [转]C#综合揭秘——细说进程、应用程序域与上下文之间的关系
- OK - A byte of python - 读书笔记
- [转]python下很帅气的爬虫包 - Beautiful Soup 示例
- mac下面xcode+ndk7配置cocos2dx &; box2d的跨ios和android平台的游戏教程
- UVA 10340 (13.08.25)
- PHP图片等比缩放,并添加Logo水印特定代码和盯
- flex与后台及页面间对象的传递
- 网页 cookie
- StructureMap经典的IoC/DI容器
- @Controller和@RestController之间的区别
- 【玩转开源】BananaPi R2 —— 第一篇 Openwrt安装
- WEB前端 HTML
- strace常用参数详解
- tensorflowwindows安装
- 【Windows】XShell中使用小键盘和ALT键(作Meta键),使BackSpace正常
- 【Python爬虫】教务处模拟登陆