题解 | #统计字符串中子串出现的次数#
统计字符串中子串出现的次数
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 j; for(int i = 0;str[i]!='\0';++i) { for( j = 0;substr[j]!='\0';++j) { if(str[i+j] == substr[j])//‘i+j’表示将str第i个字符当做首字符与substr相比较 { continue; } else { break; } } if(substr[j]=='\0') { ++count; } } cout << count << endl; }