#include <bits/stdc++.h> using namespace std; int main(){ string s; map<char, int> mp; cin>>s; int n=s.length(); for(int i=0;i<n;i++){ mp[s[ i]]; } int ans=0; char q; map<char, int>::iterator it; for(it = mp.begin();it!=mp.end();it){ if(it->second>ans){ ans = it->second; q=it->first; } } cout << q<<" "<<mp[q]; return 0; }

#include<bits/stdc++.h> using namespace std; char s[101]; char b[26]{'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'}; int a[26]; int main(){ cin>>s; int n = strlen(s); for(int j=0;j<n;j++){ for(int i=0;i<26;i++)if(s[j]==b[i])a[i]; } int x=a[0]; char x1=127; for(int i=0;i<26;i)if(a[i]>x)x=a[i]; for(int i=0;i<26;i++)if(a[i]==x&&b[i]<x1)x1=b[i]; cout<<x1<<' '<<x; return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ string s; map<char, int> mp; cin>>s; int n=s.length(); for(int i=0;i<n;i++){ mp[s[ i]]; } int ans=0; char q; map<char, int>::iterator it; for(it = mp.begin();it!=mp.end();it){ if(it->second>ans){ ans = it->second; q=it->first; } } cout << q<<" "<<mp[q]; return 0; }

要记得比较时当有两个字符出现次数相同时，应当取ASCLL码值较小者

#include <bits/stdc++.h> #define LL long long using namespace std; string a; int c[1000]; int main() { cin>>a; for(int i=0;i<a.size();i++){ c[a[i]]; } int mx=0; char x; for(char i='a';i<='z';i){ if(c[i]>mx){ mx=c[i]; x=i; } } cout<<x<<' '<<mx; return 0; }

#include<iostream> using namespace std; int t[130],mx,j; string s; int main(){ cin>>s; for(int i=0;i<s.size();i++){ int k=s[i]; t[k]; } for(int i=97;i<=122;i){ if(t[i]>mx){ mx=t[i]; j=i; } } cout<<(char)j<<" "<<mx; return 0; }

#include<bits/stdc++.h> using namespace std; int main(){ string a; cin>>a; int cnt[26]={0},max=-1,max_i=0; //a~z //0 1 2 3 4 5 6 7 8 9 10 //a b c d e f g h i j k for(int i=0;i<=a.size()-1;i++){ cnt[a[i]-'a']; } for(int i=0;i<26;i){ if(max<cnt[i]){ max=cnt[i]; //求最大值 max_i=i; //最大值的位置 } } cout<<char(max_i+'a')<<" "<<max; return 0; }