package com.test;
import com.bean.Student;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Random;
import java.util.Scanner;
import java.util.TreeSet;
import com.bean.Student;
public class test_5 {
public static void main(String[] args) {
// TODO Auto-generated method stub
//鍵盤錄入
Scanner sc =new Scanner(System.in);
System.out.println("please String:");
String line =sc.nextLine();
//將字符串轉化成字符數組
char[] arr=line.toCharArray();
//定義集合,傳入比較器對字符排序並保留重復,TreeSet
TreeSet<Character> ts =new TreeSet<>(new Comparator<Character>() {
public int compare(Character c1,Character c2) {
int num =c1-c2;
return num==0? 1 :num;
}
});
for(char c: arr) {
ts.add(c);
}
for(Character c:ts) {
System.out.print(c);
}
}
}