题解 | 统计字符串中子串出现的次数

#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 j = 0;j<strlen(str)-strlen(substr)+1;j++){
    int count2 = 0;
    if(str[j] == substr[0])
{    for(int i = 0;i<strlen(substr);i++){
        if(substr[i] == str[j+i]){
            count2++;
        }
    }}
    if(count2 == strlen(substr)) count++;
    }

    cout << count << endl;

    return 0;
}