题解 | #整型数组合并#

package main

import (
	"fmt"
	"sort"
)

func main() {
	a, b := 0, 0
	fmt.Scan(&a)
	arr1 := make([]int, 0, a)
	for i := 0; i < a; i++ {
		item := 0
		fmt.Scan(&item)
		arr1 = append(arr1, item)
	}
	fmt.Scan(&b)
	arr2 := make([]int, 0, b)
	for i := 0; i < b; i++ {
		item := 0
		fmt.Scan(&item)
		arr2 = append(arr2, item)
	}
	arr1 = append(arr1, arr2...)
	sort.Ints(arr1)
	temp := map[int]struct{}{}
	for _, m := range arr1 {
		if _, ok := temp[m]; !ok {
			fmt.Print(m)
			temp[m] = struct{}{}
		}
	}
	fmt.Println()

}