3柱子汉诺塔问题解法

[BelieveJG]

#include<stdio.h>
#include<iostream>
using namespace std;

void hanoi(int n, char begin, char mid, char end){
	if (n == 1)
		cout << begin << "->" << end << endl;
	else{
		hanoi(n - 1, begin, end, mid);
		cout << begin << "->" << end << endl;
		hanoi(n - 1, mid, begin, end);
	}

}

int main(){
	int n;
	cin >> n;
	hanoi(n, 'X', 'Y', 'Z');
	system("pause");
	return 0;
}

 python: