题解 | #统计字符串中子串出现的次数#
统计字符串中子串出现的次数
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 a = 0; int b = 0; for(int i = 0;i < 100;i++){ if(str[i] != '\0'){ a++; } } for(int i = 0;i < 100;i++){ if(substr[i] != '\0'){ b++; } } //比较字符串 for(int i = 0;i < a-b+1;i++){ for(int j = 0;j < b;j++){ if(substr[j]!=str[i+j]){ break; } else if(substr[j]==str[i+j] && j == b-1){ count++; } } } cout << count << endl; return 0; }