public class FindMostChar {
/**
* @param args
*/
public static void main(String[] args) {
sortByMostChar(args);
for (int i = 0; i < args.length; ++i) {
System.out.println(args[i]);
}
}
public static void sortByMostChar(String[] strings) {
for (int i = 1; i < strings.length; ++i) {
String tmpString = strings[i];
int j = i;
for (; j > 0 && (getWeight(tmpString) < getWeight(strings[j - 1])); --j) {
strings[j] = strings[j - 1];
}
strings[j] = tmpString;
}
}
/*
* 找出指定字符串中出现次数最多的字符的个数,具体算法为:将指定字符串中的每个字符逐个与所有字符相比较,如果相
* 等,则计数器+1
* 每轮比较完后,将计数器的值与当前字符个数最大值比较,如果计数器的值较大则将其值赋予字符个数最大值, 当字符串
* 遍历完毕后,所得的字符个数最大值即为所求
*/
private static int getWeight(String string) {
int maxTimes = 0;
boolean[] markChecked = new boolean[string.length()]; // 用于标记已测试过的字符,避免重复比较
for (int i = 0; i < markChecked.length; ++i) {
markChecked[i] = false;
}
for (int i = 0; i < string.length(); ++i) {
char tmpChar = string.charAt(i);
int tmpTimes = 0; // 计数器
if (!markChecked[i]) {
for (int j = 0; j < string.length(); ++j) { // 用当前字符与所有字符相比较,如果相等,则计数器+1
if (tmpChar == string.charAt(j)) {
++tmpTimes;
markChecked[j] = true;
}
}
}
if (tmpTimes > maxTimes) { // 如果计数器大于当前字符个数最大值
maxTimes = tmpTimes;
}
}
return maxTimes;
}
}