使用BF算法在主串S中查找子串T第一次出现的位置。函数int search_BF(char*s,c

2025-06-20 09:19:52
推荐回答(1个)
回答1:

#include#includevoid main(){ int count_substr(char *str,char *sub_str); char string[100]; char sub_str[100]; printf("input a string:\n"); scanf("%s",string); printf("input the substring:\n"); scanf("%s",sub_str); char *str1,*str2; str1 = string; str2 = sub_str; printf("count = %d",count_substr(str1,str2));}int count_substr(char *str,char *sub_str){ int count = 0; int i,j; for(i=0;i