如何解决如何将数据结构转换为另一种树结构 来自 API 的 JSON输出如下结构
我需要您的帮助来使用给定的 JSON 创建一个树状数据结构,如下所示,所需的输出结构已经在下面给出。我是编程初学者,我对数据结构只有一点点了解
来自 API 的 JSON
[
"",[
"Test",[
"Test/sample",[
"Test/sample/sample1"
]
],[
"Test/test3"
]
],[
"Test1",[
"Test1/test2"
]
],[
"cat"
]
]
输出如下结构
{
"key": "Image","label": "Image","icon": 'pi pi-folder',"children": []
},{
"key": "Test","label": "Test","icon": "pi pi-folder","children": [
{
"key": "Test/sample","label": "Sample","children": [{
"key": "Test/sample/sample1","label": "Sample1","children": []
}]
},{
"key": "Test/test3","label": "test3","children": []
},]
},{
"key": "Test1","label": "Test1","children": [{
"key": "Test1/test2","label": "test2","children": []
}]
},{
"key": "cat","label": "cat",]
以上结构为图片文件目录,目录名用标签表示,图标表示目录,子目录表示子目录
解决方法
它可以通过递归函数轻松归档
const icon = "pi pi-folder";
var a = [
"",[
"Test",[
"Test/sample",[
"Test/sample/sample1"
]
],[
"Test/test3"
]
],[
"Test1",[
"Test1/test2"
]
],[
"cat"
]
]
/**
* @param {Array} arr The child array
*/
function createChildNode(arr) {
let key = "Image";
let label = "Image";
let children = [];
if (arr.length >= 1) {
key = arr[0];
label = key.includes("/") ? key.split("/").pop() : key;
label = label.charAt(0).toUpperCase() + label.slice(1);
for (let index = 1; index < arr.length; index++) {
const element = arr[index];
children.push(createChildNode(element));
}
}
return {key: key,label: label,icon: icon,children: children};
}
var b = []
for (let index = 0; index < a.length; index++) {
const element = a[index];
b.push(createChildNode(element));
}
console.log(b);
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。