最簡單的無線分類,無限樹形菜單解決方案
阿新 • • 發佈:2018-03-02
func AD nbsp name 簡單 AC DC pos div
JS版本
整體思路就是:不管多少層級,每層都需要添加子類進去,寫個遞歸函數尋找子類即可
var data = [ {"txt":"成都", "key":"成都", "val":"", "parentKey":"四川", "index":1, }, {"txt":"雅安", "key":"雅安", "val":"", "parentKey":"四川", "index":1, }, {"txt":"四川", "key":"四川", "val":"", "parentKey":"","index":0, }, {"txt":"崇州", "key":"崇州", "val":"", "parentKey":"成都", "index":1, }, ];function addChildNode(pk){ for (var x in data){ if(data[x].parentKey==pk){ addChildNode(data[x].key); console.log("我是"+data[x].parentKey+"的:"+data[x].txt); } } } $.each(data,function(name,value) { if(value.index==0){ //console.log(value); addChildNode(value.key); } });
最簡單的無線分類,無限樹形菜單解決方案