若有多个字母出现次数相同,则输出ASCII值最小的那个
#include<iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int num = 0, max = 0;//max为出现次数,num为a[i]中的下标i
for (int i = 0; i < s.length(); i++) //s.length为字符串的字符个数
{
int count = 1;
for (int j = i + 1; j < s.length(); j++) //从a[i]的后一项逐步开始与a[i]比较,看是否相同
{
if (s[j] == s[i])
count++;
}
if (count > max || (count == max && s[i] < s[num]))
{
max = count;
num = i;
}
}
cout << s[num] << endl << max;
return 0;
}