//简单的递归
function f(a) {
if (a <= 1) {
return 1
} else {
return a + f(a - 1)
}
}
console.log(f(3)); //6
//模拟后端数据
var data = [
{
name: "所有物品",
children: [
{
name: "水果",
children: [{ name: "苹果", children: [{ name: '青苹果' }, { name: '红苹果' }] }]
},
{
name: '主食',
children: [
{ name: "米饭", children: [{ name: '北方米饭' }, { name: '南方米饭' }] }
]
},
{
name: '生活用品',
children: [
{ name: "电脑类", children: [{ name: '联想电脑' }, { name: '苹果电脑' }] },
{ name: "工具类", children: [{ name: "锄头" }, { name: "锤子" }] },
{ name: "生活用品", children: [{ name: "洗发水" }, { name: "沐浴露" }] }
]
}
]
}]
// 普通forEach循环遍历数据
function forfn() {
var str = "";
data.forEach(res => {
res.children.forEach(res2 => {
res2.children.forEach(res3 => {
res3.children.forEach(res4 => {
str += (res4.name + ";");
})
})
})
})
console.log(str);//青苹果;红苹果;北方米饭;南方米饭;联想电脑;苹果电脑;锄头;锤子;洗发水;沐浴露;
}
forfn();
// 递归遍历数据
function di(){
var str = "";
function digui(data){
data.forEach(res=>{
if (res.children) {
digui(res.children);
}else{
str += res.name + ";";
}
})
}
digui(data);
console.log(str);//青苹果;红苹果;北方米饭;南方米饭;联想电脑;苹果电脑;锄头;锤子;洗发水;沐浴露;
}
di()
递归遍历和普通forEach遍历
最新推荐文章于 2022-08-11 14:51:05 发布