递归算法以及求层级

最新推荐文章于 2022-09-14 11:21:25 发布

weixin_30572613

最新推荐文章于 2022-09-14 11:21:25 发布

阅读量553

点赞数

原文链接：http://www.cnblogs.com/required/p/10524307.html

版权

<!DOCTYPE html>
<html>
<head>
    <meta charset="UTF-8">
    <title></title>
<body>
<div id="allSee">

</div>
</body>
<script>
    var jsonObject  =[
        {
            "id": "01",
            "name": "01",
            "child": [{
                "id": "0101",
                "name": "0101",
                "child": [{
                    "id": "010101",
                    "name": "010101"
                }, {
                    "id": "010102",
                    "name": "010102"
                }, {
                    "id": "010103",
                    "name": "010103",
                    "child": [{
                        "id": "01010301",
                        "name": "01010301"
                    }]
                }]
            }, {
                "id": "0102",
                "name": "0102"
            }]
        },
        {
            "id": "02",
            "name": "02",
            "child": [{
                "id": "0101",
                "name": "0101",
                "child": [{
                    "id": "010101",
                    "name": "010101"
                }, {
                    "id": "010102",
                    "name": "010102"
                }, {
                    "id": "010103",
                    "name": "010103",
                    "child": [{
                        "id": "01010301",
                        "name": "01010301"
                    }]
                }]
            }, {
                "id": "0102",
                "name": "0102"
            }]
        }
    ];

var maxLevle  = 0;
    var numArray=[0,0,0,0];
    function calLevle(level_init,childObject){
        level_init=level_init +1;
        if(level_init >maxLevle){
            maxLevle = level_init;
        }
        var childLength  = childObject.length;
        for (var i=0;i<childLength;i++) {
            numArray[level_init-1] = numArray[level_init-1] + 1;
            var tempObj  = childObject[i];
            console.log(  level_init + "," + tempObj.id);
            if(tempObj.child){
                calLevle(level_init,tempObj.child);
            }else{

            }
        }
    }
    var length_all = jsonObject.length;
    for (var v=0;v<length_all;v++) {
        var err = [];
        err.push(jsonObject[v])
        calLevle(0,err);
        // console.log(err);
        console.log("maxLevel:"+maxLevle);
        console.log(numArray);
    }

</script>

</head>
<body>




</body>
</html>

转载于:https://www.cnblogs.com/required/p/10524307.html

weixin_30572613

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
递归算法以及求层级

<!DOCTYPE html><html><head> <meta charset="UTF-8"> <title></title><body><div id="allSee"></div></body><script> var jsonObject...
复制链接

扫一扫