题解 | #明明的随机数#

利用TreeSet既能去重又能排序

package NowCoder;

import java.util.Scanner;
import java.util.TreeSet;

//明明的随机数
public class huawei3 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (scanner.hasNextInt()) {
int n = scanner.nextInt();
TreeSet<integer> set = new TreeSet<>();
for (int i = 0; i < n; i++) {
int k = scanner.nextInt();
set.add(k);
}
for (int m : set) {
System.out.println(m);
}
}
}
}</integer>