题解 | #整型数组合并#

import java.util.*;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别       
            int n1 = in.nextInt();
            int[] num1 = new int[n1];
            for(int i = 0;i < n1;i++){
                num1[i] = in.nextInt();
            }
            int n2 = in.nextInt();
            int[] num2 = new int[n2];
            for(int i = 0;i < n2;i++){
                num2[i] = in.nextInt();
            }
            TreeSet<Integer> set = new TreeSet<>();
            for(int i = 0;i < n1;i++){
                set.add(num1[i]);
            }
            for(int i = 0;i < n2;i++){
                set.add(num2[i]);
            }
            Iterator ite = set.iterator();
            while(ite.hasNext()){
                System.out.print(ite.next());
            }
            set.clear();
        
    }
}