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

#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......
    int a = 0;
    int b = 0;
    while (a <= strlen(str)) {
        if (str[a] == substr[b]) {
            b++;
            a++;
            if (b == strlen(substr)) {
                count++;
                a--;
                b = 0;
            }
        } else {
            b = 0;
            a++;
        }

    }

    cout << count << endl;

    return 0;
}