简单 桶排

#include <iostream>
#include <algorithm>
using namespace std;
int a[1005],maxx=-1;
char maxn;
int main()
{
string s;
cin>>s;
int len=s.size();
for(int i=0;i<=len;i++)
{
a[(int)(s[i])];
}
for(int i=0;i<=122;i)
{
if(maxx<a[i])
{
maxx=a[i];
maxn=(char)(i);
}
}
cout<<maxn;
return 0;
}