API小能手- JAVA
题目描述
本题有两个关键点:去重和排序,而TreeSet完美贴合题目需求,API小能手上线~
TreeSet $O(n)$
Java代码
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
public class AcWing_0425_Force_API {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
Set<Integer> set = new TreeSet<Integer>();
for (int i = 0; i < n; i++) {
set.add(sc.nextInt());
}
System.out.println(set.size());
for (Object i: set.toArray()) {
System.out.print((int)i + " ");
}
}
}