题解 | 明明的随机数

package main

import (
	"fmt"
	"sort"
)

func main() {
    m := map[int]bool{}
    intSlice := []int{}
    var n int
    fmt.Scanf("%d", &n)
    var a int
    for i := 0; i < n; i ++ {
        fmt.Scanf("%d", &a)
        if !m[a] {
            m[a] = true
            intSlice = append(intSlice, a)
        } else {
            continue
        }
    }
    sort.Slice(intSlice, func(i, j int) bool {
        return intSlice[i] < intSlice[j]
    })
    for i := 0; i < len(intSlice); i ++ {
        fmt.Println(intSlice[i])
    }
}

用map去重，slice切片保存数字，最后排序输出