题解 | #整型数组合并#

挑战只使用数组完成，不使用除Scanner以外任何包

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int num1 = sc.nextInt();
        int[] a = new int[num1];
        for (int i = 0; i < num1; i++) {
            int temp = sc.nextInt();
            a[i] = temp;
        }
        int num2 = sc.nextInt();
        int[] b = new int[num2];
        for (int i = 0; i < num2; i++) {
            int temp = sc.nextInt();
            b[i] = temp;
        }

        //把数组a、数组b装入数组c中
        int[] c = new int[num1 + num2];
        int index = 0;
        for (int i = 0; i < a.length; i++) {
            c[index++] = a[i];
        }
        for (int i = 0; i < b.length; i++) {
            c[index++] = b[i];
        }

        sort(c);
        for (int i = 0; i < c.length - 1; i++) {
            if (c[i] == c[i + 1]) continue;
            System.out.print(c[i]);
        }
        if (c[c.length - 2] != c[c.length - 1]) System.out.print(c[c.length - 1]);
    }

    //选择排序
    public static void sort(int[] c) {
        for (int i = 0; i < c.length; i++) {
            int cur = i;
            for (int j = i; j < c.length; j++) {
                if (c[cur] > c[j]) cur = j;    //标记最小元素的索引
            }
            //交换
            int temp = c[cur];
            c[cur] = c[i];
            c[i] = temp;
        }
    }
}