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

#include <iostream>
#include <cstring>
using namespace std;

int strtimes(char *str,char *substr){
    int count=0;
    int len1=strlen(str);
    int len2=strlen(substr);
    for(int i=0;i<len1;i++){
        for(int j=0;j<len2;j++){
            if((substr[j]==str[j+i])&&(j==len2-1)) {
                count+=1;
                break;
            }
            else if(str[j+i]==substr[j]){
                continue;
            }
            else break;
        }

    }
    return count;
}

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......
    count=strtimes(str,substr);

    cout << count << endl;

    return 0;
}