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

#include <iostream>
#include <cstring>
#include <string>
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 len1 = strlen(str);
    int len2 = strlen(substr);

    for(int i = 0; i < len1; i++){
        if (strncmp(&str[i], &substr[0], len2) == 0) {
            count++;
        }
    }

    cout << count << endl;

    return 0;
}