题目：一个字符串，出现过最多次的字符是什么，出现次数是多少。

题目：一个字符串，出现过最多次的字符是什么，出现次数是多少。


import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;

public class T {
public static void main(String[] args) {
String tmp = "aaabbb";
char[] t = tmp.toCharArray();
Map only = new HashMap();
for (int i = 0; i < t.length; i++) {
only.put(t[i], t[i]);
}
Set set = only.keySet();
List all = new ArrayList();
for (Iterator iterator = set.iterator(); iterator.hasNext();) {
Object object = (Object) iterator.next();
all.add(object);
}
List last = new ArrayList();
StringBuffer str = new StringBuffer();
for (Iterator iterator = all.iterator(); iterator.hasNext();) {
Object o = (Object) iterator.next();
for (int i = 0; i < t.length; i++) {
if (o.equals(t[i])) {
str.append(o);
}
}
str.append(",");
}
String la = str.toString();
String[] sla = la.split(",");
int size[] = new int[sla.length];
for (int i = 0; i < sla.length; i++) {
size[i] = sla[i].length();
}
for (int i = 0; i < size.length; i++) {
int tp = 0;
for (int j = i + 1; j < size.length; j++) {
if (size[i] > size[j]) {
tp = size[j];
size[j] = size[i];
size[i] = tp;
}
}
}
int lastSize = size[size.length-1];
for (int i = 0; i < sla.length; i++) {
String tm = sla[i];
if(tm.length() == lastSize){
System.out.println("出现最多次数的字母是 ：" +tm.charAt(0));
System.out.println("最大次数是 ：" + tm.length());
}
}

}
}