day-15 代码

汉诺塔 - 递归

#include <iostream>
#include <cstring>
#include <string>
#include <iomanip>
#include <windows.h>
#include <ctime>

using namespace std;

int count = 0;

void hanoi(int n, char a, char b, char c);
void Move(char a, char b);



int main()
{
	cout << endl << endl;
	int n = 3;
	hanoi(n, 'a', 'b','c');
	cout << endl;


	cout << endl;
	return 0;
}

void hanoi(int n, char a, char b, char c)
{
	if (n == 1)
	{
		Move(a, b);
	}
	else
	{
		hanoi(n - 1, a, c, b);
		Move(a, b);
		hanoi(n - 1, c, b, a);
	}
}
void Move(char a, char b)
{
	//count += 1;
	cout << "         " << a << " -> " << b << endl;
}