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

#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++) {  // 当str里的字符和substr的第一个字符相同时进入判断
        if (str[i] == substr[0]) {
            for (int j{i}, k{0}; str[j] != '\0' && substr[k] != '\0' && str[j] == substr[k];) {
                j++;
                k++;
                if (substr[k] == '\0') {
                    count++;
                }
            }
        }
    }

    cout << count << endl;

    return 0;
}