递归简化数据处理方式

递归简化数据 处理前的数据
[
{
“guid”: “C81242A4E81A278BE0501AACD4C71F2D”,
“code”: “01”,
“name”: “预算科”,
“children”: [
{
“guid”: “C81397AB80A17B29E0501AACD4C7622A”,
“code”: “907”,
“name”: “包头市财政局(预算)”,
“children”: [
{
“guid”: “C81397AB80A27B29E0501AACD4C7622A”,
“children”: [],
“code”: “907001”,
“name”: “预算科本级”,
}
]
}
],
}
]
处理方式

 getMiniNodes(array) {
    const filterList = []
    array.forEach((ele) => {
      const { children, guid } = ele
      if (children && children.length) {
        const currentEle = {
          children: [],
          guid
        }
        const result = this.getMiniNodes(children)
        if (result.length) {
          currentEle.children = result
          filterList.push(currentEle)
        }
      } else {
        filterList.push({ guid })
      }
    })
    return filterList
  }
  }```
处理后的数据
[
    {
        "guid": "C81242A4E81A278BE0501AACD4C71F2D",
        "children": [
            {
                "guid": "C81397AB80A17B29E0501AACD4C7622A",
                "children": [
                    {
                        "guid": "C81397AB80A27B29E0501AACD4C7622A",
                    }
                ]
            }
        ]
    }
]


递归数据过滤(例如过滤最底层掉符合某个条件的数据)
```html
const filterMember = (key, data) => {
    const filterList = [];
    data.forEach((ele) => {
        const { member, ...other } = ele;
        if (member && member.length) {
            const currentEle = {
                member: [],
                ...other
            };
            const result = filterMember(key, member);

            if (result.length) {
                currentEle.member = result;
                filterList.push(currentEle);
            }
        } else if (other.age > key) {
            filterList.push(other);
        }
    });
    return filterList;
}

处理后的数据(过滤掉了最底层的一个数据)

[
    {
        "guid": "C81242A4E81A278BE0501AACD4C71F2D",
        "children": [
            {
                "guid": "C81397AB80A17B29E0501AACD4C7622A",
                "children": [], //过滤掉的数据
                "code": "907",
                "name": "包头市财政局(预算)",
            }
        ],
        "code": "01",
        "name": "预算科",
    }
]
  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值