问个 js 算法题

• 请不要在回答技术问题时复制粘贴 AI 生成的内容

This topic created in 1583 days ago, the information mentioned may be changed or developed.

const treeData = [
  {
    id: 1,
    children: {
      id: 2,
      children: {
        id: 3
      }
    }
  },
  {
    id: 4,
    children: {
      id: 5,
      children: {
        id: 6
      }
    }
  }
]

// 2 1-2-3 1 1-2-3 3 1-2-3 结构给个 ID 输出上下级

9 replies

hello2090

Feb 21, 2022

虽然我 leetcode 刷了 500 多题，但我真看不太懂这题的意思。。

murmur

Feb 21, 2022

你的 children 不能带一个指针指向 parent 么

wenzichel

Feb 21, 2022

只能遍历了吧

cxe2v

Feb 21, 2022

有点像链表

Kasumi20

Feb 21, 2022

function findIndex(id) {
try {
treeData.forEach((item, index) => {
var child = item;
while (true) {
if (child.id === id) {
throw index;
}
if (typeof child.children !== 'object') {
break;
}
child = child.children;
}
});
} catch (index) {
return index;
}
return -1;
}

function getStruct(index) {
var child = treeData[index];
var ids = [];
while (true) {
if (typeof child.id === 'number') {
ids.push(child.id);
}
if (typeof child.children !== 'object') {
break;
}
child = child.children;
}
return ids;
}

function test(id) {
var index = findIndex(id);
var ids = getStruct(index);
console.log(id + ' ' + ids.join('-'));
}

test(1);
test(2);
test(6);

/*
1 1-2-3
2 1-2-3
6 4-5-6
*/

chairuosen

Feb 21, 2022

这结构不是 tree 这是两根电线杆啊

aikilan

Feb 21, 2022

遍历递归，谈不上算法，简单暴力，毫无意义

nowgoo

Feb 21, 2022

投机一下

const output = function(treeData, n){
let flat = e => e.children ? e.id + "-" + flat(e.children) : e.id,
flatted = treeData.map(flat).map(e => "-"+ e +"-").join(',');
return flatted.match(new RegExp('[^,]*-'+ n +'-[^,]*'))[0]
.replace(/^-+/, '')
.replace(/-+$/, '');
}

jguo

Feb 21, 2022

你这算哪门子 children