連結串列的有序集合

Problem Description

Input

Output

Example Input

1
2
2
1 1
6
6 3 5 2 2 3

Example Output

2
1
2 3 5 6

Hint

Author

qinchuan

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

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		while ( in.hasNext() ) {
			int n = in.nextInt();
			int [] array = new int [n];
			TreeSet<Integer> treeSet = new TreeSet<Integer>();
			for ( int i = 0; i < n; i++ ) {
				array[i] = in.nextInt();
				treeSet.add(array[i]);
			}
			int cnt = 1;
			for ( Integer k : treeSet ) {
				if ( cnt == treeSet.size() ) {
					System.out.println(k);
				} else {
					System.out.print(k+" ");
				}
				cnt++;
			}
		}
		in.close();
	}

}