js計算之遞迴

標籤：length   dig   遍曆   結構   highlight   var   blog   UI   har   

看以下js代碼：

var w = [{        label: ‘你好‘,        node: [            {                label: ‘你好啊‘,                node: [{                    label: "還好",                    node: []                }, {                    label: ‘你好吧‘,                    node: []                },{                    label: "還好",                    node: []                }, {                    label: ‘你好吧‘,                    node: [                        {                            label: "還好",                            node: []                        }, {                            label: ‘你好吧‘,                            node: []                        }                    ]                }]            }        ]    },        {            label: ‘我來了‘,            node: []        }    ]

　　怎麼找出上面所有的label值，上面就是一個樹型結構;

用遞迴遍曆裡面的所有對象如下：

    var b = [];    function digui(c) {        for (var i = 0; i < c.length; i++) {            if (c[i].node.length === 0) {                b.push(c[i].label)            } else {                b.push(c[i].label)                digui(c[i].node)            }        }    }    digui(w)    console.log(b);

js計算之遞迴