1 寻找指定字符并给出出现次数
#include <iostream>
using namespace std;
unsigned int c_in_str(const char* str,char ch);
int main()
{
char mm[15]="minimum";
unsigned int ms=c_in_str(mm, 'm');
cout<<"ms="<<ms<<endl;
return 0;
}
unsigned int c_in_str(const char* str,char ch)
{
unsigned int count=0;
while (*str) {
if(*str==ch)
count++;
str++;
}
return count;
}
using namespace std;
unsigned int c_in_str(const char* str,char ch);
int main()
{
char mm[15]="minimum";
unsigned int ms=c_in_str(mm, 'm');
cout<<"ms="<<ms<<endl;
return 0;
}
unsigned int c_in_str(const char* str,char ch)
{
unsigned int count=0;
while (*str) {
if(*str==ch)
count++;
str++;
}
return count;
}
2 寻找不固定出现字符的最大出现次数
#include <iostream>
#include <string>
using namespacestd;
char most_times_chara(char* test,int* p);
int main()
{
char testStr[100] = {"We are happppppppppy." };
int times=0;
int* pt=×
char mostcharacter;
mostcharacter=most_times_chara(testStr, pt);
cout<<times<<endl;
cout<<mostcharacter<<endl;
return0;
}
char most_times_chara(char* test,int* p)
{
int a2Z[256];
memset(a2Z,0, sizeof(a2Z));
while (*test) {
a2Z[*test]++;
test++;
}
int re=0;
for(int i=0;i<256;i++)
{
if(a2Z[i]>a2Z[re]){
re=i;
*p=a2Z[re];
}
}
return re;
}