将2D阵列转换为树

Question

我正在使用Google Apps脚本,我可以将Google电子表格数据检索为2D数组.我想将此数组转换为树表示,以在Google云端硬盘中构建文件夹层次结构.

这是我可以从Google电子表格中获得的2D数组.

var data =  [
       ["F1", "F1S1","",""],
       ["", "F1S2", "F1S2S1", ""],
       ["", "", "F1S2S2", ""],
       ["", "F1S3", "", ""],
       ["F2", "F2S1", "", ""],
       ["", "F2S2", "F2S2S1", ""],
       ["", "", "F2S2S2", "F2S2S2S1"],
       ["", "", "", "F2S2S2S2"]
    ]

现在我试图把它变成JSON以下.

[
    {
        "name" : "F1",
        "children" : [
            {
                "name" : "F1S1"
            },
            {
                "name" : "F1S2",
                "children" : [
                    {
                        "name" : "F1S2S1"
                    },
                    {
                        "name" : "F1S2S2"
                    }
                ]
            },
            {
                "name" : "F1S3"
            }
        ]
    },
    {
        "name" : "F2",
        "children" : [
            {
                "name" : "F2S1"
            },
            {
                "name" : "F2S2",
                "children" : [
                    {
                        "name" : "F2S2S1"
                    },
                    {
                        "name" : "F2S2S2",
                        "children" : [
                            {
                                "name" : "F2S2S2S1"
                            },
                            {
                                "name" : "F2S2S2S2"
                            }
                        ]
                    }
                ]
            }
        ]
    }
]

我曾尝试使用array.reduce方法,但无法推断出正确的逻辑.有人可以指导我.

var data = [
  ["F1", "F1S1", "", ""],
  ["", "F1S2", "F1S2S1", ""],
  ["", "", "F1S2S2", ""],
  ["", "F1S3", "", ""],
  ["F2", "F2S1", "", ""],
  ["", "F2S2", "F2S2S1", ""],
  ["", "", "F2S2S2", "F2S2S2S1"],
  ["", "", "", "F2S2S2S2"]
]

var tree = data.reduce(function(tree, item) {
  var tempTree = tree;
  for (var i = 0; i < item.length; i++) {
    if (!tempTree[item[i]])
      tempTree[item[i]] = {};
    tempTree = tempTree[item[i]];
  }
  return tree;
}, {});

console.log(tree)

Answer 1

使用排序数据,您可以使用辅助数组来保持插入节点的最后级别.

var data = [["F1", "F1S1", "", ""], ["", "F1S2", "F1S2S1", ""], ["", "", "F1S2S2", ""], ["", "F1S3", "", ""], ["F2", "F2S1", "", ""], ["", "F2S2", "F2S2S1", ""], ["", "", "F2S2S2", "F2S2S2S1"], ["", "", "", "F2S2S2S2"]],
    result = [],
    levels = [result];

data.forEach(a =>
    a.forEach((name, i) => {
        if (!name) return;
        levels[i].push({ name, children: (levels[i + 1] = []) });
    })
);
  
console.log(result);

.as-console-wrapper { max-height: 100% !important; top: 0; }

如果您不喜欢空的孩子,可以提前检查并添加子节点,然后再添加新节点.

var data = [["F1", "F1S1", "", ""], ["", "F1S2", "F1S2S1", ""], ["", "", "F1S2S2", ""], ["", "F1S3", "", ""], ["F2", "F2S1", "", ""], ["", "F2S2", "F2S2S1", ""], ["", "", "F2S2S2", "F2S2S2S1"], ["", "", "", "F2S2S2S2"]],
    result = [],
    levels = [result];

data.forEach(a =>
    a.forEach((name, i) => {
        if (!name) return;
        if (i && !levels[i - 1][levels[i - 1].length - 1].children) {
            levels[i] = [];
            levels[i - 1][levels[i - 1].length - 1].children = levels[i];
        }
        levels[i].push({ name });
    })
);
  
console.log(result);

.as-console-wrapper { max-height: 100% !important; top: 0; }