相关疑难解决方法(0)

递归算法如何适用于河内塔?

这是我解释递归的书中的代码.问题是我不明白该计划采取的步骤:

var hanoi = function(disc,src,aux,dst) {
    if (disc > 0) {
        hanoi(disc - 1,src,dst,aux);
        document.write("Move disc " + disc + " from " + src + " to " + dst + "<br />");
        hanoi(disc - 1,aux,src,dst);
    }
};

hanoi(3,"src","aux","dst");
Run Code Online (Sandbox Code Playgroud)

这是输出的读取方式:

Move disc 1 from src to dst
Move disc 2 from src to aux
Move disc 1 from dst to aux
Move disc 3 from src to dst
Move disc 1 from aux to src
Move disc 2 from …
Run Code Online (Sandbox Code Playgroud)

javascript recursion towers-of-hanoi

10
推荐指数
1
解决办法
9359
查看次数

标签 统计

javascript ×1

recursion ×1

towers-of-hanoi ×1