题解 | #整型数组合并#

class HelloWorld {
    public static void main(String[] args) {
      // 去重用set 排序用treeSet 完美
         Scanner in = new Scanner(System.in);
        int a1 = in.nextInt();
        int[] arr1 = new int[a1];
        for (int i = 0; i < a1; i++) {
            arr1[i] = in.nextInt();
        }
        int a2 = in.nextInt();
        int[] arr2 = new int[a2];
        for (int i = 0; i < a2; i++) {
            arr2[i] = in.nextInt();
        }

        Set<Integer> set = new TreeSet<>();
        for (int i = 0; i < a1; i++) {
            set.add(arr1[i]);
        }
        for (int i = 0; i < a2; i++) {
            set.add(arr2[i]);
        }
        System.out.println(set);
        StringBuilder sb = new StringBuilder();
        for (Integer i :
                set) {
            sb.append(i);
        }
        System.out.println(sb.toString());
    }
}