题解 | #整型数组合并#

TreeSet 进行去重

import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNext()) { // 注意 while 处理多个 case
            int count1 = in.nextInt();
            int [] Array1 = new int[count1];
            for (int i = 0; i < count1; i++) {
                Array1[i] = in.nextInt();
            }
            int count2 = in.nextInt();
            int[] Array2 = new int[count2];
            for (int i = 0; i < count2; i++) {
                Array2[i]= in.nextInt();
            }
            System.out.println(ArrayZhenghe(Array1, Array2));
        }
    }
    public static String ArrayZhenghe(int[] Array1, int[] Array2) {
        StringBuffer sb = new StringBuffer();
        Set<Integer> set = new TreeSet<Integer>();
        for (int i = 0; i < Array1.length; i++) {
            set.add(Array1[i]);
        }
        for (int j = 0; j < Array2.length; j++) {
            set.add(Array2[j]);
        }
        for (int temp : set) {
            sb.append(temp);
        }
        return sb.toString();
    }
}