import java.util.Iterator;
import java.util.Scanner;
import java.util.TreeSet;
public class CharCount {
static CharCount cc = new CharCount();
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String input = scan.nextLine();
int []num = new int[input.length()];
for (int i = 0; i < input.length(); i++) {
num[input.indexOf(input.charAt(i))]++;
}
TreeSet<CharNum> set = new TreeSet<CharNum>();
for (int i = 0; i < input.length(); i++) {
if(num[i]!=0)
set.add(cc.new CharNum(input.charAt(i),num[i]));
}
Iterator<CharNum> it = set.iterator();
while (it.hasNext()) {
CharNum cn = it.next();
char ch = cn.ch;
print(ch);
}
}
private static void print(char ch) {
System.out.print(ch);
}
class CharNum implements Comparable<CharNum>{
private char ch;
private int num;
public CharNum(char ch,int num){
super();
this.ch = ch;
this.num = num;
}
public int compareTo(CharNum o){
if(this.num > o.num)
return -1;
else if(this.num < o.num)
return 1;
return this.ch - o.ch;
}
public char getCh() {
return ch;
}
public void setCh(char ch) {
this.ch = ch;
}
public int getNum() {
return num;
}
public void setNum(int num) {
this.num = num;
}
}
}
字符统计
最新推荐文章于 2022-12-21 00:55:40 发布