汉诺塔问题---递归实现

#include<iostream>
using namespace std;

void move(char A, char B){
	cout << A << "---->" << B << endl;
}
void hannuota(int n, char A, char B, char C){
	if (n == 1)
		move(A, C);
	else{
		hannuota(n - 1, A, C, B);    //A借助C将n-1个盘子移到B柱
		move(A, C);                  //将第n号盘子移到C柱
		hannuota(n - 1, B, A, C);    //B借助A将n-1个盘子移到C柱
	}

}

int main(){
	int n = 3;
	char A = 'A';
	char B = 'B';
	char C = 'C';

	hannuota(n, A, B, C);
	return 0;
}