Go re-order

Input Description:

Enter multiple lines, first enter the number of random integers, and then enter the corresponding number of integers

Output Description:

Returns multiple rows, processed results

Input Example 1:

11102040326740208930040015

Output Example 1:

10152032406789300400
Use HashSet and TreeSet respectively to achieve

Import Java.util.arraylist;import java.util.collections;import Java.util.hashset;import Java.util.Iterator;import Java.util.scanner;public class M2 {public static void main (string[] args) {Scanner scanner=new Scanner (system.in); Scanner.hasnext ()) {hashset<integer> alist=new hashset<integer> (); int i=scanner.nextint (); for (int j=0; j < I; J + +) {Alist.add (Scanner.nextint ());} Iterator Iterator=alist.iterator (); arraylist<integer> n =new arraylist<integer> (); for (int j = 0; J < Alist.size (); j + +) {N.add ((Integer) ITER Ator.next ());} Collections.sort (n); for (int m = 0; m < alist.size (); m++) {System.out.println (N.get (M));}}}

while (Sc.hasnext ()) more than one input

Import Java.util.scanner;import Java.util.treeset;public class M3 {public static void main (string[] args) {Scanner Scanne R=new Scanner (system.in); while (Scanner.hasnext ()) {treeset<integer> alist=new treeset<integer> (); int i= Scanner.nextint (); for (int j=0; j< i; j + +) {Alist.add (Scanner.nextint ());} for (Integer m:alist) {System.out.println (M);}}}}

Go re-order