dth2331 2017-03-23 11:45
浏览 64
已采纳

如何在Go中尽可能均匀地随机分割地图?

I have a quick question. I am fairly new to golang. Say I have a map like so:

map[int]string

How could I randomly split it into two maps or arrays and as close to even as possible? So for example, if there are 15 items, it would be split 7 - 8.

  • 写回答

2条回答 默认 最新

  • doujiazong0322 2017-03-23 12:47
    关注

    For example:

    func split(m map[int]string) (odds map[int]string, evens map[int]string) {
        n := 1
        odds = make(map[int]string)
        evens = make(map[int]string)
        for key, value := range m {
            if n % 2 == 0 {
                evens[key] = value
            } else {
                odds[key] = value
            }
            n++
        }
        return odds, evens
    }
    

    It is actually an interesting example, because it shows a few aspects of Go that are not obvious for beginners:

    • range m iterates in a random order, unlike in any other language as far as I know,
    • the modulo operator % returns the remainder of the integer division,
    • a function can return several values.
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(1条)

报告相同问题?

悬赏问题

  • ¥20 腾讯企业邮箱邮件可以恢复么
  • ¥15 有人知道怎么将自己的迁移策略布到edgecloudsim上使用吗?
  • ¥15 错误 LNK2001 无法解析的外部符号
  • ¥50 安装pyaudiokits失败
  • ¥15 计组这些题应该咋做呀
  • ¥60 更换迈创SOL6M4AE卡的时候,驱动要重新装才能使用,怎么解决?
  • ¥15 让node服务器有自动加载文件的功能
  • ¥15 jmeter脚本回放有的是对的有的是错的
  • ¥15 r语言蛋白组学相关问题
  • ¥15 Python时间序列如何拟合疏系数模型