递归寻找子节点的所有父节点(父,爷,祖等)
let retArr: any = []; /** * 递归找ID * @param str * @param arr */ const findPId = (str: any, arr = data as any) => { let curPId = str; for (var idx in arr) { if (arr[idx].id == str) { //返回名字 retArr.push(arr[idx].name); curPId = arr[idx].parentId; //找到的时候把找到的这个节点的父ID赋给变量,然后从新开始递归树找到该父节点的父节点,依次循环得到结果 if (arr[idx].children) { findPId(curPId, data); } } //没找到的时候正常递归去寻找下面的节点 if (arr[idx].children) { findPId(curPId, arr[idx].children); } } return retArr; }; const clickHanlder = () => { let ret = findPId("ZX5001"); console.log(ret); };
HTML:
<button type="button" @click="clickHanlder">查找</button>
测试数据:
const data = [ { id: "1", name: "zs", parentId: "0", children: [ { id: "1-1", name: "zs-1", parentId: "1", children: [ { id: "1-1-1", name: "zs-1-1", parentId: "1-1", children: [ { id: "ZX5001", name: "zs-1-1-1-1", parentId: '1-1-1', children: [ { id: "1-1-1-1-41", name: "zs-1-1-zx", parentId: "ZX5001", children: null, }, ], }, ], }, { id: "1-1-2", name: "zs-1-2", parentId: "1-1", children: [ { id: "1-1-2-ZX", name: "zs-1-2-1", parentId: 1, children: null }, ], }, ], }, { id:'zxxc', name: "zs-2", parentId: "1", children: [ { id: "2-1-1", name: "zs-2-1", parentId: "zxxc", children: [ { id: "2-1-1-1", name: "zs-2-1-1Z", parentId: "2-1-1", children: [ { id: "2-1-1-1-1", name: "zs-2-1-1-1", parentId: "2-1-1-1", children: null, }, ], }, ], }, ], }, ], }, ];
积累小的知识,才能成就大的智慧,希望网上少一些复制多一些原创有用的答案
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 震惊!C++程序真的从main开始吗?99%的程序员都答错了
· 别再用vector<bool>了!Google高级工程师:这可能是STL最大的设计失误
· 单元测试从入门到精通
· 【硬核科普】Trae如何「偷看」你的代码?零基础破解AI编程运行原理
· 上周热点回顾(3.3-3.9)
2016-08-11 JS等号的小注释