合并2个数组为1个无重复元素的有序数组--Go对比Python

Go实现：

package main

import (
    "fmt"
    "sort"
)

func main() {
    var a = []int{1, 6, 45, 2, 9, 15, 7}
    var b = []int{2, 80, 9, 67, 52, 15, 100, 99}
    c := sumArr(a, b)
    fmt.Println("合并后的数组为")
    fmt.Println(c)
    d := remArr(c)
    fmt.Println("合并、去重后的数组为")
    fmt.Println(d)
    e := sortArr(d)
    fmt.Println("合并、去重、排序后的数组为")
    fmt.Println(e)
}

func sumArr(a, b []int) []int {
    var c []int
    for _, i := range a{
        c = append(c, i)
    }
    for _, j := range b{
        c = append(c, j)
    }
    return c
}

func remArr(c []int) []int {
    d := make([]int, 0)
    tempMap := make(map[int]bool, len(c))
    for _, e := range c{
        if tempMap[e] == false{
            tempMap[e] = true
            d = append(d, e)
        }
    }
    return d
}

func sortArr(e []int) []int {
    sort.Ints(e[:])
    return e
}

Python实现：

a = [1, 6, 45, 2, 9, 15, 7]
b = [2, 80, 9, 67, 52, 15, 100, 99]
c = a + b

# 方法一：
d = set(c)
print(sorted(d))

# 方法二：
e = []
for i in c:
    if i not in e:
        e.append(i)
        continue
print(sorted(e))