题解 | #统计字符串中子串出现的次数#
统计字符串中子串出现的次数
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; int len=strlen(str),len1=strlen(substr); for(int k = 0;k<len;k++) { if(str[k]==substr[0]) { int tmp=k; for(int j=0;j<len1;j++) { if(str[tmp]==substr[j]) { if(substr[j+1]=='\0') { count++; } tmp++; } else { break; } } } } // write your code here...... cout << count << endl; return 0; }