递归遍历

      childrenCb(children) {

        const newChildren = [];

        if(Array.isArray(children)) {

          for (const val of children) {

            if (typeof val.children !== 'object') {

              newChildren.push({

                title: val.preName,

                key:val.id,

              })

            } else if (val != children) {

              newChildren.push({

                title: val.preName,

                key:val.id,

                children: this.childrenCb(val.children)

              })

            }

          }

        }

        return newChildren;

      },

    // 递归遍历

    recursive(arr){

//arr传递的多重数组

      this.childrenCb(arr);

      const newArr = arr.map(value => ({

          title: value.preName,

          key: value.id,

          children: this.childrenCb(value.children)

      }))

      console.log(newArr,"newArr");

    },

©著作权归作者所有,转载或内容合作请联系作者
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。