题解 | #统计字符串中子串出现的次数#
统计字符串中子串出现的次数
https://www.nowcoder.com/practice/9eb684f845a446f3b121472de2ea75cd
#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......
char* ptr1 = str;
char* ptr2 = ptr1;
char* ptr3 = substr;
while (*ptr1) {
ptr2 = ptr1;
ptr3 = substr;
bool flag = 1;
while (*ptr2 && *ptr3) {
if (*ptr2 != *ptr3) {
flag = 0;
break;
}
ptr2++;
ptr3++;
}
if (flag) {
count++;
}
if (!*ptr2) {
break;
}
ptr1++;
}
cout << count << endl;
return 0;
}
指针比对法
