方法1
import java.io.*;
import java.util.*;
public class Main
{
public static void main(String[] args) throws Exception{
BufferedReader cin = new BufferedReader(new InputStreamReader(System.in));
int nn = Integer.parseInt(cin.readLine());
while(nn-- >0){
String str = cin.readLine();
char[] ch = str.toCharArray();
System.out.println((char)tongji(ch));
}
}
static int tongji (char[] ch){
int[] sum = new int[27];
for(int x=0; x<ch.length; x++)
sum[ch[x]-97]++;
int max = 0;
for(int y=0; y<sum.length-1; y++)
if(sum[max]<sum[y+1]) max=y+1;
return max+97;
}
}
方法2
import java.util.*;
public class Hello {
public static void main(String[] args) throws Exception {
Scanner scan = new Scanner(System.in);
int count = scan.nextInt();
while(count-- > 0){
Map<Character,Integer> map = new TreeMap<>();
String str = scan.next();
char[] ch = str.toCharArray();
int[] time = new int[ch.length];
Arrays.fill(time, 1); ****
for(int i = 0; i < ch.length; i++){
if(!map.containsKey(ch[i])){
map.put(ch[i],time[i]);
}else {
int temp = map.get(ch[i]);
map.put(ch[i],++temp);
}
}
Set<Map.Entry<Character,Integer>> set = map.entrySet();
Iterator<Map.Entry<Character,Integer>> iter = set.iterator();
int max = 1;
int i = 0;
char c = 0;
while (iter.hasNext()){
Map.Entry<Character,Integer> me = iter.next();
if(i++ == 0)
c = me.getKey();
if(me.getValue() > max){
max = me.getValue();
c = me.getKey();
}
}
System.out.println(c);
}
}
};