题解 | #统计字符串中子串出现的次数#
统计字符串中子串出现的次数
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;str[i]!='\0';i++)
{
bool flag=1;
for(int j=0;substr[j]!=0;j++)
{
if(str[i+j]==substr[j]&&str[i+j]!=0)
{
continue;
}
else {
flag=0;
break;
}
}
if(flag)
{
count++;
}
}
cout << count << endl;
return 0;
}
#统计字符串中子串出现的次数#