字符串操作：统计子串在主串中出现的次数

 

//---------------------------------------------------------------------------
#include <iostream>
using namespace std;
//---------------------------------------------------------------------------
const int MAX_LEN1=100;
const int MAX_LEN2=10;
//---------------------------------------------------------------------------
int main(int argc, char* argv[])
{
	char prmr[MAX_LEN1], chld[MAX_LEN2]; //声明主、子串

    gets(prmr);
 	if (strlen(prmr)>MAX_LEN1)
	{
      	cout<<"输入字符数超出主串设定值";
        exit(EXIT_FAILURE);      //stdlib宏定义：EXIT_FAILURE=1
    }

    gets(chld); 
    if (strlen(chld)>MAX_LEN2)
    {
        cout<<"输入字符数超出从串设定值";
		exit(EXIT_FAILURE);
    }

    int cnt=0;
    for (int i=0; prmr[i]!='\0'; i++)
    {
      	int j;
    	for (j=0; chld[j]!='\0'; j++)
        {
        	if (prmr[i+j]!=chld[j])
            	break;
        }
        if (chld[j]=='\0')
        	cnt++;
    }
    cout<<cnt;

    return 0;	
}
//---------------------------------------------------------------------------