duanlu9816 2019-07-12 13:19
浏览 373
已采纳

Golang从所有数组中存在的值创建数组

I need to create an array from multiple arrays. The new array must only contain the values that is present in all arrays passed in. For example.

array1 := []string{"hello", "germany", "brasil", "fiji"}
array2 := []string{"goodbye", "germany", "brasil", "fiji"}
array3 := []string{"hello", "brasil", "fiji"}
array4 := []string{"hello", "brasil", "fiji", "usa"}

func mergeArrays(arrs ...[]string) []string{
   // process arrays
}

myNewArray := mergeArrays(array1,array2,array3,array4)
fmt.Println(myNewArray) // ["fiji", "brasil"]

The example should return ["fiji", "brasil"] since they are the only values present in all arrays.

How could I go about writing a function that could achieve such a goal in golang?

This is my attempt but feels a bit clumsy

func mergeArrays(arrs ...[]string) []string {
    var finalArr []string
    if len(arrs) == 0 {
        return finalArr
    }

    for i, a := range arrs {
        if i == 0 {
            finalArr = arrs[0]
            continue
        }
        for i, e := range finalArr {
            if !strContains(a, e) {
                finalArr = append(finalArr[:i], finalArr[i+1:]...)
            }
        }

    }

    return finalArr
}

func strContains(s []string, e string) bool {
    for _, a := range s {
        if a == e {
            return true
        }
    }
    return false
}

Playground link: https://play.golang.org/p/KRygw7OVBbn

  • 写回答

2条回答 默认 最新

  • duan1443 2019-07-12 14:36
    关注

    Per my comment above, here's one way to do it with go maps and thus avoid iterating over potentially large slices:

    func itemize(a []string) map[string]struct{} {
        m := make(map[string]struct{})
        for _, v:=range a {
            m[v] = struct{}{} // struct{}{} == an empty struct (i.e. a value that incurs no storage)
        }
        return m
    }
    
    func commonElements(arrs ...[]string) (results []string) {
        if len(arrs) == 0 {
            return // edge case
        }
    
        mm := itemize(arrs[0]) // master map
    
        for i:=1; i<len(arrs);i++ {
            m := itemize(arrs[i]) // current map
            for k := range mm {
                if _, ok := m[k]; !ok {
                    delete(mm, k) // master item not in current slice, so remove from master
                }
            }
        }
    
        results = make([]string, len(mm)) // make a precisely sized slice...
        i:=0
        for k := range mm {
            results[i] = k // so we can insert results directly into it without using append
            i++ 
        }
    
        return
    }
    

    https://play.golang.org/p/pTaXR-nY9zm

    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(1条)

报告相同问题?

悬赏问题

  • ¥15 公交车和无人机协同运输
  • ¥15 stm32代码移植没反应
  • ¥15 matlab基于pde算法图像修复,为什么只能对示例图像有效
  • ¥100 连续两帧图像高速减法
  • ¥15 组策略中的计算机配置策略无法下发
  • ¥15 如何绘制动力学系统的相图
  • ¥15 对接wps接口实现获取元数据
  • ¥20 给自己本科IT专业毕业的妹m找个实习工作
  • ¥15 用友U8:向一个无法连接的网络尝试了一个套接字操作,如何解决?
  • ¥30 我的代码按理说完成了模型的搭建、训练、验证测试等工作(标签-网络|关键词-变化检测)