1042 字符统计
请编写程序，找出一段给定文字中出现最频繁的那个英文字母。
输入格式：
输入在一行中给出一个长度不超过 1000 的字符串。字符串由 ASCII 码表中任意可见字符及空格组成，至少包含 1 个英文字母，以回车结束（回车不算在内）。
输出格式：
在一行中输出出现频率最高的那个英文字母及其出现次数，其间以空格分隔。如果有并列，则输出按字母序最小的那个字母。统计时不区分大小写，输出小写字母。
输入样例：
tex
This is a simple TEST. There ARE numbers and other symbols 1&2&3...........This is a simple TEST. There ARE numbers and other symbols 1&2&3...........输出样例：
tex
e 7e 7Solution：
java
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
char[] chars = in.readLine().toLowerCase().toCharArray();
int[] book = new int[26];
for (int i = 0; i < chars.length; i++) {
if (chars[i] >= 'a' && chars[i] <= 'z') {
book[chars[i] - 'a']++;
}
}
int max = book[0], t = 0;
for (int i = 1; i < book.length; i++) {
if (book[i] > max) {
max = book[i];
t = i;
}
}
System.out.printf("%s %d", (char) ('a' + t), max);
}
}import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
char[] chars = in.readLine().toLowerCase().toCharArray();
int[] book = new int[26];
for (int i = 0; i < chars.length; i++) {
if (chars[i] >= 'a' && chars[i] <= 'z') {
book[chars[i] - 'a']++;
}
}
int max = book[0], t = 0;
for (int i = 1; i < book.length; i++) {
if (book[i] > max) {
max = book[i];
t = i;
}
}
System.out.printf("%s %d", (char) ('a' + t), max);
}
}