比如说在含abce abc cda dfac cdaf数组里寻找abc,若abc存在于这个数组里则输出yes
供参考:
#include <stdio.h>
int count(char* str, char* substr);
int main()
{
char str[80], substr[80];
int n = 0;
gets(str);
gets(substr);
n = count(str, substr);
printf("%s\n",n ? "yes" : "no");
return 0;
}
int count(char* str, char* substr)
{
int i, j, k, num = 0;
for (i = 0; str[i] != '\0'; i++)
for (j = i, k = 0; substr[k] == str[j]; k++, j++)
if (substr[k+1] == '\0') { num++; break; }
return num;
}
可以用stl里面的算法