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

#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......

    string str1 = str;
    string str2 = substr;
    int flag = 0;
    int tmp_i = 0;
    
    for (int i = 0; i < str1.size(); i++) {
        tmp_i = i;
        for (int j = 0; j < str2.size(); j++) {
            if (str2[j] == str1[tmp_i]) {
                tmp_i++;
                if (j == str2.size() - 1) {
                    flag = 1;
                }
            } else {
                flag = 0;
                break;
            }
        }

        if (flag == 1) {
            count++;
            flag = 0;
        }

    }

    cout << count << endl;

    return 0;
}