多维数组遍历递归
changeTree(val) {
//递归删除末级空的children
let arr = [];
if (val.length !== 0) {
val.forEach((item) => {
let obj = {};
obj.id = item.id;
obj.label = item.label;
obj.parentId = item.parentId;
obj.name = item.name;
obj.value = item.value;
if (item.children.length >= 1) {
obj.children = this.changeTree(item.children);
}
arr.push(obj);
});
}
return arr;
},
发表评论