题解 | #整型数组合并#

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
                Scanner in = new Scanner(System.in);
        java.util.Set<Integer> set1 = new java.util.HashSet<>();
        java.util.Set<Integer> set2 = new java.util.HashSet<>();
        int[] arr1 = null;
        int[] arr2 = null;
        // 注意 hasNext 和 hasNextLine 的区别
        int count=0;
        while (in.hasNext()) { // 注意 while 处理多个 case
            count++;
            String a = in.nextLine();
            if (count==1) {
                arr1 = new int[Integer.valueOf(a)];
            }else if (count==2){
                String[] s = a.split(" ");
                for (int i = 0; i < s.length; i++) {
                    arr1[i]=Integer.valueOf(s[i]);
                    set1.add(Integer.valueOf(s[i]));
                }
            }else if (count==3){
                arr2 = new int[Integer.valueOf(a)];
            }else if (count==4){
                String[] s = a.split(" ");
                for (int i = 0; i < s.length; i++) {
                    arr2[i]=Integer.valueOf(s[i]);
                    set2.add(Integer.valueOf(s[i]));
                }
                break;
            }

        }

        //整合数组

        set1.addAll(set2);
        java.util.Set<Integer> set = new java.util.TreeSet<>();
        set.addAll(set1);
        set.stream().sorted(java.util.Comparator.naturalOrder()).forEach(e -> {
            System.out.print(e);
        });

    }
}