function deepTree(data, parent_code) {
var result = [], temp;
for (var i = 0; i < data.length; i++) {
if (data[i].parent_code == parent_code) {
var obj = {"label": data[i].name,"value": data[i].code};
temp = deepTree(data, data[i].code);
if (temp.length > 0) {
obj.children = temp;
}
result.push(obj);
}
}
return result;
}
数组递归成树状tree结构
最新推荐文章于 2023-06-04 23:39:29 发布