deptList树状结构(每一项有parentID)
element该节点
loop(deptList , element){
var arrRes = [];
if (deptList.length == 0) {
if (!!element) {
arrRes.unshift(deptList)
}
return arrRes;
}
let rev = (data, nodeId) => {
for (var i = 0, length = data.length; i < length; i++) {
let node = data[i];
if (node.key == nodeId) {
arrRes.unshift(node)
rev(deptList, node.parentId);
break;
} else {
if (!!node.children) {
rev(node.children, nodeId);
}
}
}
return arrRes;
};
arrRes = rev(deptList, element);
return arrRes;
}
版权声明:本文为weixin_46554760原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。