确保原列表有id与pid, 并且有对应关系,
通过递归生成树形菜单
// 生成树菜单
buildTree(list, pid) {
let arr = []
for (let i = 0; i < list.length; i++) {
if(pid == list[i].pid) {
list[i].children = this.buildTree(list, list[i].id);
arr.push(list[i])
}
}
return arr
}
调用: this.list = this.buildTree(list, 0)