题解 | #统计字符串中子串出现的次数#
统计字符串中子串出现的次数
http://www.nowcoder.com/practice/9eb684f845a446f3b121472de2ea75cd
#include #include using namespace std;
int main() {
char str[100] = { 0 };
char substr[100] = { 0 };
cin.getline(str, sizeof(str));
cin.getline(substr, sizeof(substr));
int count = 0;
// write your code here......
int flag;
int i=0;
while(i<strlen(str)){
flag=0;
if(str[i]==substr[0]){
for(int j=0;j<strlen(substr);j++){
if(str[i+j]!=substr[j]){
flag=1;
}
}
if(flag==0){
count++;
i=i+strlen(substr)-1;
}
else{
i++;
}
}else{
i++;
}
}
cout << count << endl;
return 0;
}
