如何將遞歸轉換為循環

Question

我想把這個遞歸變成循環，我該怎么做？ 我需要得到孩子的全名，我是遞歸做的，我嘗試了很多時間循環做，有人知道我該怎么做嗎？

const Inode: INode = {
    name: 'a',
    children: [
        {
            name: 'b',
            children: []
        },
        {
            name: 'c',
            children: [{
                name: 'd',
                children: []
            },]
        },
        {
            name: 'e',
            children: []
        },
    ]
}
const getAllNamesByRecursion = (Inode: INode) => {
    console.log(Inode.name)
    Inode.children.forEach((child) => {
        if (Inode.children) {
            return getAllNamesByRecursion(child);
        }
    })

}

Answer 1

如評論中所述，可以模仿遞歸。 事實上，機器語言沒有遞歸，所以在編譯時，遞歸的 function 的實現方式完全相同：跳轉（實現循環）和堆棧。 這是javascript中的解決方案，已標記。

 const inodes = { name: 'a', children: [ { name: 'b', children: [] }, { name: 'c', children: [ { name: 'd', children: [] }, ], }, { name: 'e', children: [] } ], }; function collectWithRecursion(fn, node) { return [ fn(node), ...(node.children?? []).flatMap(node => collectWithRecursion(fn, node)), ]; } function collectWithoutRecursion(fn, node) { // start with the top node in the stack const stack = [node]; const result = []; // repeat until the whole stack is processed while (stack.length) { // get the next node from the stack and process it const node = stack.pop(); result.push(fn(node)); // if the node has children, add them to the stack if (node.children) { stack.push(...node.children.reverse()); } } return result; } console.log("with recursion:", collectWithRecursion(node => node.name, inodes)); console.log("without recursion:", collectWithoutRecursion(node => node.name, inodes));

Answer 2

我不確定我是否得到你的問題，但我認為這就是你想要實現的目標？ js中的解決方案

 const Inode = { name: 'a', children: [ { name: 'b', children: [] }, { name: 'c', children: [{ name: 'd', children: [] },] }, { name: 'e', children: [] }, ] } const getAllNamesByRecursion = (node) => { if (node.children) { return node.children.map((child) => child.name) } return null } console.log(getAllNamesByRecursion(Inode))