hanoi.cpp

来自「实现了汉诺塔算法」· C++ 代码 · 共 27 行

#include<stdio.h>

void Move(int n,char x,char y)  //实现移动的输出
{
	printf("Move disk %d from %c to %c\n",n,x,y);
}

void Hanoi(int n,char A,char B,char C)  //汉诺塔函数，将n个盘从A座借助于B座移动到C座，且满足盘子成“品”字行排列
{
	if(n==1)
		Move(n,A,C);	
    else
	{
		Hanoi(n-1,A,C,B);
		Move(n,A,C);
	    Hanoi(n-1,B,A,C);
	}
}

void main()  //主函数
{
	int n;
	printf("Please input the number of Diskes：");
	scanf("%d",&n);
	Hanoi(n,'A','B','C');
}