js递归实现无限极ul分类

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <meta http-equiv="X-UA-Compatible" content="ie=edge">
    <title>递归</title>
</head>
<body>
<script type="text/javascript">
    var ml = [
        {   
            name:"A",
            child:[
                {
                    name:"a1",
                    child:[
                        {name:"a11"},
                        {name:"a12"},
                        {name:"a13"},
                        {name:"a14"}
                    ]
                },
                {name:"a2"},
                {name:"a3"},
                {name:"a4"}
            ]
        },
        {   
            name:"B",
            child:[
                {
                    name:"b1",
                    child:[
                        {
                            name:"b11",
                            child:[
                                {name:"b111"},
                                {name:"b112"},
                                {name:"b113"},
                                {
                                    name:"b114"
                                    ,child:[
                                        {name:"b114_3"},
                                        {
                                            name:"b114_1"
                                            ,child:[
                                                {name:"b114_1"},
                                                {name:"b114_2"},
                                                {
                                                    name:"b114_3",
                                                    child:[
                                                        {name:"b111"},
                                                        {name:"b112"},
                                                        {name:"b113"}
                                                    ]
                                                },
                                                {name:"b114_4"}
                                            ]    
                                        },
                                        {name:"b114_2"},
                                        {name:"b114_4"}
                                    ]
                                }
                            ]
                        },
                        {name:"b12"},
                        {name:"b13"},
                        {name:"b14"}
                    ]
                },
                {name:"b2"},
                {name:"b3"},
                {name:"b4"}
            ]
        },
        {   
            name:"A",
            child:[
                {
                    name:"a1",
                    child:[
                        {name:"a11"},
                        {name:"a12"},
                        {name:"a13"},
                        {name:"a14"}
                    ]
                },
                {name:"a2"},
                {name:"a3"},
                {name:"a4"}
            ]
        },
    ]

    var str = ""
    function dg(ml){
        str+="<ul>"
        for(var i=0;i<ml.length;i++){
            str+="<li>"+ml[i].name
            if(ml[i].child){
                str += "<ul>"
                for(var j=0;j<ml[i].child.length;j++){
                    str+="<li>"+ml[i].child[j].name+"</li>"
                    if(ml[i].child[j].child){
                        dg(ml[i].child[j].child);
                    }
                }
                str+="</ul>"
            }
            str+="</li>"
        }
        str+="</ul>"
        // console.log(str)
        return str;
    }
    // document.documentElement//.appendChild(dg(ml));
    document.body.innerHTML=dg(ml)
</script>    
</body>
</html>

 

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值