题解 | #统计字符串中子串出现的次数#
统计字符串中子串出现的次数
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...... int len1=strlen(str); int len2=strlen(substr); for(int i=0;i<len1-len2+1;i++) { if(substr[0]==str[i]) { int sum=0; for(int j=0;j<len2;j++) { if(substr[j]==str[i+j]) sum++; } if(sum==len2) count++; } } cout << count << endl; return 0; }