[c/cpp]：递归算法：汉诺塔问题代码

[c/cpp]：递归算法：汉诺塔问题代码

 

 

 

 

一、代码

#include <iostream>


using namespace std;


// plate_numbers=n;
// from_stick=from;
// target_stick=to;
// assistant_stick=assistant;
void hanoi(int n, char from, char to, char assistant)
{
    if (n==1) {
        cout << "\t[move]:" << n    << ",\t" ;
        cout << "[from]:"   << from << ",\t" ;
        cout << "[to]:"     << to   << endl  ;
        return ;
    }
    // move_from:from; move_to:assistant;  move_assistant:to
    hanoi(n-1, from, assistant, to);
        cout << "\t[move]:" << n    << ",\t" ;
        cout << "[from]:"   << from << ",\t" ;
        cout << "[to]:"     << to   << ",\t" ;
        cout << "[assistant]:" << assistant << endl;
    // move_from:assistant;  move_to:to,  move_assistant:from
    hanoi(n-1, assistant, to, from);
}


//
int main(int argc, char *argv[], char *envp[])
{
    
    hanoi(3, 'F', 'T', 'A');
    
    return 0;
}

 

 

 

 二、运行结果

	[move]:1,	[from]:F,	[to]:T
	[move]:2,	[from]:F,	[to]:A,	[assistant]:T
	[move]:1,	[from]:T,	[to]:A
	[move]:3,	[from]:F,	[to]:T,	[assistant]:A
	[move]:1,	[from]:A,	[to]:F
	[move]:2,	[from]:A,	[to]:T,	[assistant]:F
	[move]:1,	[from]:F,	[to]:T

 

 

 

三、参考资料：

 

　　1、　　「递归」是检验编程天赋的试金石（神级教程）　　-　　https://www.bilibili.com/video/BV1LiS1YSEgF/?vd_source=bef44438dcfc47fc71532258ae4beac7

 

　　2、　　c++在线编译工具　　-　　https://coliru.stacked-crooked.com/