解题思路:使用TreeSet类加入时自动排序和去重
注意事项:
参考代码:
package cWeb.acm; import java.util.Scanner; import java.util.Set; import java.util.TreeSet; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner in = new Scanner(System.in); int N = in.nextInt(); //TreeSet加入是自动排序去重 Set<Integer> set = new TreeSet<>(); for (int i = 0; i < N; i++) { set.add(in.nextInt()); } System.out.println(set.size()); for (Integer integer : set) { System.out.print(integer+" "); } } }
0.0分
0 人评分