整形数组合并

package oj.test;


import java.util.Iterator;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.TreeSet;

public class test {


 /**
  * 整形数组合并

  * 将两个整型数组按照升序合并，并且过滤掉重复数组元素  *

3

1 3 5

4

-1 3 0 2

输出

-101235

  */
 public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
 
Integer n1 = Integer.parseInt(sc.nextLine());
String str1 = sc.nextLine();
String[] arr1 = str1.split(" ");
 
Integer n2 = Integer.parseInt(sc.nextLine());
String str2 = sc.nextLine();
String[] arr2 = str2.split(" ");
 
 
Integer[] a1 = new Integer[n1];
Integer[] a2 = new Integer[n2];
for(int i=0;i<n1;i++){
a1[i] = Integer.parseInt(arr1[i]);
}
for(int i=0;i<n2;i++){
a2[i] = Integer.parseInt(arr2[i]);
}
 
TreeSet<Integer> ts = new TreeSet<Integer>();
for(int i=0;i<n1;i++){
ts.add(a1[i]);
}
for(int i=0;i<n2;i++){
ts.add(a2[i]);
}
 
String temp="";
Iterator<Integer> it = ts.iterator();
while(it.hasNext()){
temp=temp+it.next();
}
sop(temp.trim());
  
 }


 public static void sop(Object obj){
System.out.println(obj);
 }


 


}