从嵌套数组构建祖先列表

function buildAncestors(nestedArray) {
  let ancestors = [];

  function traverse(arr, currentPath) {
    arr.forEach(item => {
      let newPath = currentPath.concat(item.id);
      ancestors.push(newPath);
      if (item.children) {
        traverse(item.children, newPath);
      }
    });
  }

  traverse(nestedArray, []);
  return ancestors;
}

// 示例嵌套数组
const nestedArray = [
  { id: 1, children: [{ id: 2, children: [{ id: 3 }] }] },
  { id: 4, children: [{ id: 5 }] }
];

console.log(buildAncestors(nestedArray));
// 输出: [[1, 2, 3], [1, 2], [1], [4, 5], [4]]

function buildAncestorsIterative(nestedArray) {
  let stack = nestedArray.map(item => ({ item, path: [] }));
  let ancestors = [];

  while (stack.length > 0) {
    let { item, path } = stack.pop();
    let newPath = path.concat(item.id);
    ancestors.push(newPath);
    if (item.children) {
      item.children.forEach(child => {
        stack.push({ item: child, path: newPath });
      });
    }
  }

  return ancestors;
}

function* buildAncestorsGenerator(nestedArray) {
  function* traverse(arr, currentPath) {
    for (let item of arr) {
      let newPath = currentPath.concat(item.id);
      yield newPath;
      if (item.children) {
        yield* traverse(item.children, newPath);
      }
    }
  }

  yield* traverse(nestedArray, []);
}

const ancestors = [...buildAncestorsGenerator(nestedArray)];
console.log(ancestors);