javascript - 依赖元素结构化数组的层次树

Question

我正在寻找一种有效的方法来从 JavaScript 中的以下数据结构构建树。每个条目的长度始终为 5，并且条目之间永远不存在任何间隙（即空值）。

var geographies = [
    [ 'Denmark', 'Midtjylland', null, null, null ],
    [ 'Denmark', 'Syddanmark', 'Langeland', null, null ],
    [ 'Denmark', 'Syddanmark', 'Ærø', null, null ],
    [ 'Japan', 'Okinawa', 'Izenajima', null, null ],
    [ 'Japan', 'Hokkaido', 'Rishiri', 'Rishiri-to', null ]
]

所需的输出应如下所示：

[{
    label: "Denmark",
    children: [{
            label: "Midtjylland",
        },
        {
            label: "Syddanmark",
            children: [{
                label: "Langeland"
            },
            {
                label: "Ærø"
            }]
        }
    ]
}, {
    label: "Japan",
    children: [{
        label: "Okinawa",
        children: [{
            label: "Izenajima"
        }]
    }, {
        label: "Hokkaido",
        children: [{
            label: "Rishiri",
            children: [{
                label: 'Rishiri-to'
            }]
        }]
    }]
}]

标签： javascriptrecursiontreehierarchyhierarchical-data

Answer 1

您可以在每个子数组的第一个元素上对数组进行to_tree分组，如果它们不为空，则调用分组数组：

function to_tree(d){
   var c = {}
   for (var i of d){
       var k = i.shift();
       c[k] = k in c ? [...c[k], i] : [i]
   }
   return Object.keys(c).map(function(x){return {label:x, ...(c[x].filter(j => j.length).length ? {children:to_tree(c[x].filter(j => j.length))} : {})}})
}
var geographies = [[ 'Denmark', 'Midtjylland', null, null, null ], [ 'Denmark', 'Syddanmark', 'Langeland', null, null ], [ 'Denmark', 'Syddanmark', 'Ærø', null, null ], [ 'Japan', 'Okinawa', 'Izenajima', null, null ], [ 'Japan', 'Hokkaido', 'Rishiri', 'Rishiri-to', null ]]
var geographies1 = [[ 'Greece', null, null, null, null ], [ 'Greece', 'Ionian Islands', 'Lefkada', null, null ], [ 'Greece', 'Attica', 'Salamis', null, null ], [ 'Greece', 'Ionian Islands', 'Cephalonia', null, null ], [ 'Greece', 'Thessaly', 'Skiathos', null, null ], [ 'Greece', 'South Aegean', 'Kea', null, null ], [ 'Greece', 'Attica', 'Kythira', null, null ]]
var r = to_tree(geographies.map(x => x.filter(y => y != null)));
var r1 = to_tree(geographies1.map(x => x.filter(y => y != null)));
console.log(r)
console.log(r1)

输出：

[
  {
    "label": "Denmark",
    "children": [
      {
        "label": "Midtjylland"
      },
      {
        "label": "Syddanmark",
        "children": [
          {
            "label": "Langeland"
          },
          {
            "label": "Ærø"
          }
        ]
      }
    ]
  },
  {
    "label": "Japan",
    "children": [
      {
        "label": "Okinawa",
        "children": [
          {
            "label": "Izenajima"
          }
        ]
      },
      {
        "label": "Hokkaido",
        "children": [
          {
            "label": "Rishiri",
            "children": [
              {
                "label": "Rishiri-to"
              }
            ]
          }
        ]
      }
    ]
  }
]

[
  {
    "label": "Greece",
    "children": [
      {
        "label": "Ionian Islands",
        "children": [
          {
            "label": "Lefkada"
          },
          {
            "label": "Cephalonia"
          }
        ]
      },
      {
        "label": "Attica",
        "children": [
          {
            "label": "Salamis"
          },
          {
            "label": "Kythira"
          }
        ]
      },
      {
        "label": "Thessaly",
        "children": [
          {
            "label": "Skiathos"
          }
        ]
      },
      {
        "label": "South Aegean",
        "children": [
          {
            "label": "Kea"
          }
        ]
      }
    ]
  }
]