计算子串出现的次数

来源:互联网 发布:分水岭分割算法原理 编辑:程序博客网 时间:2024/05/11 21:08
#include <stdio.h>#include <string.h>int find(char str[],char sub[]){int i,j,count,n,size;n = 0;size = strlen(str);for(i = 0;i < size;i++){j = 0;count = 0;while((str[i] == sub[j]) && (sub[j]) != '\0'){count++;j++;i++;}if(count == strlen(sub)){n++;}}return n;}int main(){char str[100],sub[10];int n;printf("输入字符串:");scanf("%s",&str);printf("输入子字符串:");scanf("%s",&sub);n = find(str,sub);printf("出现次数:%d",n);printf("\n");    return 0;}

0 0