题目要求:去重,从小到大排列。完美符合TreeSet的性质
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int arr[] = new int[N];
TreeSet ts = new TreeSet();
for(int i=0;i<N;i++){
ts.add(in.nextInt());
}
Iterator i = ts.iterator();
while(i.hasNext()){
System.out.println(i.next());
}
}