创建树状菜单递归

    /**
     * @description 递归 数组,递归主key,递归关联key
     */
    getChildren(datas, keya, keyb) {
        let data = []
        // 找到头
        for (let i = 0; i < datas.length; i++) {
            if (datas[i][keyb] == "") {
                datas[i].children = this.getChildrens(datas[i], datas, keya, keyb)
                data.push(datas[i])
            }
        }
        return data
    }
    // 层级递归
    getChildrens(data, datas, keya, keyb) {
        let tempdata = []
        if (keya && keyb) {
            for (let i = 0; i < datas.length; i++) {
                if (data[keya] == datas[i][keyb]) {
                    tempdata.push(datas[i])
                }
            }
            // 每层都调用自己,直到自身没有
            if (tempdata.length) {
                for (let i = 0; i < tempdata.length; i++) {
                    tempdata[i].children = this.getChildrens(tempdata[i], datas, keya, keyb)
                }
            }
        }
        return tempdata;
    }