function deepDealRepeatAry (list) {
// 先将外层数组去重
const map = new Map()
const tempList = list.filter(v => !map.has(v.id) && map.set(v.id, v))
// 递归 对数组中数据含有children的数组 依次去重
return tempList.map(item => {
if (item.children && item.children.length > 0) {
return {
...item,
children: deepDealRepeatAry(item.children)
}
}
return item
})
}