代码实现
package lanqiaoTest;
import java.util.Scanner;
public class demo1 {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
String str = scanner.next();
int[] a=new int[26];
for (int i = 0; i < str.length(); i++) {
a[str.charAt(i) - 'a']++;
}
// 找出出现最多次的字母以及次数
int max=0,index=0;
for (int i = 0; i < 26; i++) {
if (a[i]>max){
max=a[i];
index=i;
}
}
char c=(char)('a'+index);
System.out.println(c);
System.out.println(max);
}
}