递归法求解汉诺塔问题C++代码

递归法求解汉诺塔问题C++代码干货

话不多说上代码:

#include<iostream>

using namespace std;

void Hanoi(int n,char A, char B ,char C){
	if(n>1) 
		cout<<A<<"-->"<<C<<endl;
	else{
		Hanoi(n-1,A,C,B);
		cout<<A<<"-->"<<C<< endl;
		Hanoi(n-1,B,A,C);
	}
}

int main(){
	int n=10;
	cout << "Process started"<< endl;
	Hanoi(n,'A','B','C');
}

猜你喜欢

转载自blog.csdn.net/qq_44880708/article/details/106227986