5-Binary String Matching

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 

来源

网络

上传者

naonao

#include<iostream>
#include<stdlib.h>
#include<string>
using namespace std;
int main()
{
int N;
cin>>N;
while(N--)
{
  string A,B;
  cin>>A>>B;
  int len1,len2,i,count=0,n;
  len1=A.length(),len2=B.length();
  for(i=0;i<=len2-len1;i++)
     {
      if(B.find(A,i)>=0)
        {
        n=B.find(A,i);

        i=n;//i=n后会再执行一个i++,刚好使得i从当前位的下一位开始查找

 if(i<0)//判断结束的条件，若i<0，则说明后面没有A这个子串

 break;
        count++;
}
  
     }
  cout<<count<<endl;
}
system("pause");
return 0;
}