请教go语言算法将二维数组转换为目录结构

怎么入门Golang编程？需要学习哪些知识点？这是新手们刚接触编程时常见的问题；下面golang学习网就来给大家整理分享一些知识点，希望能够给初学者一些帮助。本篇文章就来介绍《请教go语言算法将二维数组转换为目录结构》，涉及到算法、go，有需要的可以收藏一下

问题内容

我想实现一个类似RDM这样的目录树。写了好久，也没写出来，总是问题多多，唉~
只能求教一下大神们。希望时间复杂度越低越好。

我想像RDM一样，把以下这些key按“:”号分割

[
  "answer:aa:bb",
  "answer:aa:cc",
  "question:book1",
  "question:book1:answer",
  "question:book1:answer:name1",
  "question:book1:answer:name2",
  "timeout_1",
  "timeout_2",
];

希望生成这样的目录结构

[
    {
        "name":"answer",
        "value":"",
        "child":[
            {
                "name":"aa",
                "value":"", //不是最终节点，显示为空
                "child":[
                    {
                        "name":"bb",
                        "value":"answer:aa:bb", //最终节点显示全路径
                        "child":[]
                    },
                    {
                        "name":"cc",
                        "value":"answer:aa:cc",
                        "child":[]
                    }
                ]
            },

        ]
    },
    {
        "name":"question",
        "child":[
            {
                "name":"book1",
                "value":"question:book1", //这种情况，如果一个路径到这里有key，则显示
                "child":[
                    {
                        "name":"answer",
                        "value":"question:book1:answer",
                        "child":[
                            {
                                "name":"name1",
                                "value":"question:book1:answer:name1",
                                "child":[]
                            },
                            {
                                "name":"name2",
                                 "value":"question:book1:answer:name2",
                                "child":[]
                            }
                        ]
                    }
                ]
            }
        ]
    },
    {
        "name":"timeout_1",
        "value":"timeout_1",
        "child":[]
    },
    {
        "name":"timeout_2",
        "value":"timeout_2",
        "child":[]
    }
]

正确答案

package main

import (
    "encoding/json"
    "strings"
)

var values = []string{
    "answer:aa:bb",
    "answer:aa:cc",
    "question:book1",
    "question:book1:answer",
    "question:book1:answer:name1",
    "question:book1:answer:name2",
    "timeout_1",
    "timeout_2",
}

type Node struct {
    Name  string
    Value string
    Child map[string]Node
}

func main() {
    root := make(map[string]Node)

    for _, value := range values {
        t := root
        // 根据 : 拆分字符串
        keys := strings.Split(value, ":")
        l := len(keys)
        for i := 0; i < l-1; i++ {
            k := keys[i]
            if tm, has := t[k]; has {
                // 复用并进入下一层节点
                t = tm.Child
            } else {
                // 新建并进入下一层节点
                t[k] = Node{
                    Name:  k,
                    Child: map[string]Node{},
                }
                t = t[k].Child
            }
        }
        // 为最后一个 key 时 单独处理成叶子节点
        t[value] = Node{
            Name:  keys[l-1],
            Value: value,
            Child: nil,
        }
    }
    r, _ := json.Marshal(root)
    println(string(r))
}

本篇关于《请教go语言算法将二维数组转换为目录结构》的介绍就到此结束啦，但是学无止境，想要了解学习更多关于Golang的相关知识，请关注golang学习网公众号！