递归的使用2019-06-10

/**

* 递归

*/

function digui(parent){

var sons = parent.childNodes;

for(var i=0;i

var son = sons[i];

if(son.nodeType=="3"){

var value =son.nodeValue.match(/[^\s]+/g);

if(value!=null){

console.log(value[0]);

}

}

if(son.nodeType=="1")

digui(son);

}

}

var lis = document.querySelectorAll("body>ul>li");

for (var i = 0; i < lis.length; i++) {

var parent = lis[i];

console.log(parent.getAttribute("class"));

                digui(parent);

}