标签:arr name 递归 祖等 children 节点 parentId id zs
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, }, ], }, ], }, ], }, ], }, ];
标签:arr,name,递归,祖等,children,节点,parentId,id,zs 来源: https://www.cnblogs.com/llcdbk/p/16576825.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。