//二级数组
var tree = [];
data.forEach(function(item) {
var level1 = tree.find(function(node) {
return node.fathno === item.fathno;
});
console.log(level1);
if (!level1) {
level1 = {
fathno: item.fathno,
fathna: item.fathna,
children: []
};
console.log(level1);
tree.push(level1);
}
var level2 = {
na: item.na,
no: item.no
};
level1.children.push(level2);
});
console.log(tree);
var map = {},
dest = [];
for (var i = 0; i < departList.length; i++) {
var ai = departList[i];
if (!map[ai.fathna]) {
dest.push({
fathno: ai.fathno,
fathna: ai.fathna,
data: [ai]
});
map[ai.fathno] = ai;
map[ai.fathna] = ai;
} else {
for (var j = 0; j < dest.length; j++) {
var dj = dest[j];
if (dj.fathna == ai.fathna) {
dj.data.push(ai);
break;
}
}
}
}
console.log(dest)