题解 | #统计字符串中子串出现的次数#
统计字符串中子串出现的次数
https://www.nowcoder.com/practice/9eb684f845a446f3b121472de2ea75cd
#include <iostream>
#include <cstring>
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......
for(int i=0;i<strlen(str);i++){
int control=0;
if(substr[0]==str[i]){
for(int j=1;j<strlen(substr);){
if(substr[j]==str[i+j]){
j++;
control++;}
else j=strlen(str);
}
}
if(control==(strlen(substr)-1))count++;
}
cout << count << endl;
return 0;
}
