首頁(yè) 猿問(wèn) 跪求！平行結(jié)構(gòu)數(shù)據(jù)，依次查找父數(shù)據(jù)

跪求！平行結(jié)構(gòu)數(shù)據(jù)，依次查找父數(shù)據(jù)

JavaScript

慕斯王 2019-07-27 00:13:26

letarr=[{code:'abcd',pcode:'abc',},{code:'abc',pcode:'ab'},{code:'ab',pcode:'a'}]letobj={code:'abcd',pcode:'abc',}如上所示，arr里面的數(shù)據(jù)都是有上下關(guān)系的，現(xiàn)在希望根據(jù)obj在arr中依次查找父級(jí)，比如obj的父應(yīng)該是{code:'abc',pcode:'ab'},然后繼續(xù)查找{code:'abc',pcode:'ab'}的父數(shù)據(jù)應(yīng)為{code:'ab',pcode:'a'}，以此類推，最后將符合條件的數(shù)據(jù)存放到一個(gè)數(shù)組里面，求一個(gè)遞歸的解法。

查看完整描述

2 回答

Qyouu

TA貢獻(xiàn)1786條經(jīng)驗(yàn) 獲得超11個(gè)贊

從時(shí)間復(fù)雜度上來(lái)說(shuō)，不建議筆者使用遞歸，遞歸隱藏問(wèn)題，如內(nèi)存泄漏，建議采用如下方案：functiongetParent(obj,arr){letcopyArr=[...arr];letitems=[obj];letindex=getIndex(arr,obj);while(index!==-1){items=copyArr.splice(index,1);if(items.length){index=getIndex(copyArr,items[0]);}}returnitems;}functiongetIndex(arr,obj){returnarr.findIndex((el)=>obj.pcode===el.code);}應(yīng)用letarr=[{code:'abcd',pcode:'abc',},{code:'abc',pcode:'ab'},{code:'ab',pcode:'a'},{code:"a",pcode:"123"}]letobj={code:'abcd',pcode:'abc'}getParent(obj,arr);如果使用遞歸，建議使用樓下的遞歸方案。

反對(duì) 回復(fù) 2019-07-27

FFIVE

TA貢獻(xiàn)1797條經(jīng)驗(yàn) 獲得超6個(gè)贊

循環(huán)獲取到當(dāng)前obj的父級(jí)元素，然后將父級(jí)元素作為當(dāng)前元素遞歸下去，直到找不到父級(jí)元素為止：functiongetAllParents(obj,arr){letparent=arr.filter(item=>item.code===obj.pcode);if(parent.length){parent=parent.concat(getAllParents(parent[0],arr));}returnparent;}調(diào)用：letarr=[{code:'abcd',pcode:'abc',},{code:'abc',pcode:'ab'},{code:'ab',pcode:'a'}]letobj={code:'abcd',pcode:'abc',}console.log(getAllParents(obj,arr));