去重
Reset = (arr) => {
let res = new Map();
return arr.filter((v) => !res.has(v.id) && res.set(v.id, 1));
};
树结构
function add(list, activeid, newarr) {
let newArr = list.map((v, i) => {
if (v.id == activeid) {
v.children = newarr;
}
if (v?.children?.length > 0) {
add(v.children, activeid, newarr);
}
return v;
});
return newArr;
}