蛮力法：设计算法求解字符串的模式匹配问题，并编程实现。

/* 蛮力法求字符串模式匹配总数，并显示每一个匹配子串的首个字符索引 */

#include <iostream>
#include <cstdio>
#include <string>
using namespace std;

//The main function
int main()
{
string str1, str2;
int num = 0;

printf("please input text：\n");
getline(cin, str1);
printf("please input you want to find the substring：\n");
getline(cin, str2);

printf("This program default下标从0开始\n");
for(int i=0; i<str1.size(); i++){

if(str1[i]==str2[0]){

int totalString = 1;

for(int j=0; j<str2.size(); j++){

if(str1[i+j]!=str2[j]){

totalString = 0;
break;
}
}

if(totalString){
printf("the %dth matching substring's first letter下标 is %d\n",++num,i);
}
}
}
if(num==0){
printf("No matching substring");
}else{
printf("Total Found %d matching substring\n",num);
}

}