Binary String Matching-----C语言解法与STL解法

时间限制：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

题目大意：求第二个字符串中包含有几个第一个字符串。

代码如下：

（1）数组解法：

#include<stdio.h>

#include<string.h>

int main()

{

int n,i,j,k,x,y,a;

char s[1000],t[1000],ch[1000];

scanf("%d",&n);

while(n--)

{

k=a=0;

memset(ch,0,sizeof(ch));//(将ch（数组）的所有元素初始化为0）

scanf("%s %s",s,t);

x=strlen(s);//（统计字符串中字符的个数）

y=strlen(t);

j=0;

for(i=0;i<y;i++)

{

ch[k++]=t[i];

ch[k]='\0';

if(k==x)

{

if(strcmp(ch,s)==0)//（比较两个字符串）

a++;

i=j;

j++;

k=0;

}

}

printf("%d\n",a);

}

return 0;

}

（2）STL解法：

#include<string>
#include<iostream>
using namespace std;
int main()
{
    string s,m,ss;
    int n,a=0;
    cin>>n;
    while(n--)
    {
        a=0;
        cin >> s >> m;
        int x=s.length();
        int y=m.length();
        for(int i=0;i<y-x+1;i++)
        {
            ss=m.substr(i,x);//substr()函数，复制一个子字符串，从指定位置开始，并有指定长度
            if(s.compare(ss)==0)
                a++;
        }
        cout<<a<<endl;
    }
    return 0;
}