题目:输入一个字符串,计算字符串中子串出现的次数
分析:采用Brute-Force算法寻找目标串中子串的个数
#include<stdio.h>
#include<string.h>int searchsubstr(char * str, char *sub,int subl);
char * s_gets(char *st, int n);
int main()
{
char str1[20];
char sub[20];
int subl;
printf("输入长度小于20的字符串:");
s_gets(str1, 20);
printf("输入长度小于20的子串:");
s_gets(sub, 20);
subl = strlen(sub);
printf("子串的个数是%d\n", searchsubstr(str1, sub,subl));
return 0;
}
char * s_gets(char * st, int n)
{
char * ret_val;
int i = 0;
ret_val = fgets(st, n, stdin);
if (ret_val)
{
while (st[i] != '\n'&&st[i] != '\0')
i++;
if (st[i] == '\n')
st[i] = '\0';
else
while (getchar() != '\n')
continue;
}
return ret_val;
}
int searchsubstr(char * str, char *sub,int subl)
{
int i, j;
int num;
num = 0;
i = 0;
j = 0;
while (str[i]!='\0')
{
if (str[i] == sub[j])
{
i++;
j++;
}
else
{
i = i - j + 1;
j = 0;
}
if (j == subl)
{
num++;
j = 0;
}
}
return num;
}
示例结果:
输入长度小于20的字符串:asdasdaszxds
输入长度小于20的子串:asd
子串的个数是2
请按任意键继续. . .