统计单词个数以及出现频数最高的字母
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
int hash[26],size,sum=0,word=0,maxn=0;
int main(){
vector<int> v;
memset(hash,0,sizeof(hash));
char str[1001];
gets(str);
size=strlen(str);
for(int i = 0;i<size;++i){
if(str[i]!=' '){
sum++;
if(str[i]<='Z'){
hash[str[i]-'A']++;
}
else if(str[i]>='a'){
hash[str[i]-'a']++;
}
}
else{
if(i>0){
if(str[i-1]==' ') continue;
else word++;
}
else word++;
}
}
printf("%d\n%d\n",sum,word+1);
for(int j = 0;j<26;++j){
if(maxn<hash[j]){
maxn=hash[j];
v.clear();
v.push_back(j);
}
else if(maxn==hash[j]){
v.push_back(j);
}
}
int size=v.size();
for(int j = 0;j<size-1;++j){
printf("%c ",v[j]+'a');
}
printf("%c\n",v[size-1]+'a');
printf("%d\n",maxn);
return 0;
}