递归之汉诺塔

规则

• 每次只能移动一个圆盘
• 圆盘可以插在A B C中的任何一个塔座上
• 任何时刻都不能将一个较大的圆盘压在较小的圆盘之上

 

代码：

#include <iostream>
using namespace std;

void move(char from ,char to) {
    cout<<"Move  "<<from<<" to  "<<to<<endl;
}


void hanoi(int n, char first, char second,  char third) {
    if(n==1)
        move(first,third);
    else{
        hanoi(n-1,first,third,second);
        move(first,third);
        hanoi(n-1,second,first,third);
    }
}

int main(){
    int m;
    cout<<"the number of diskes:"<<endl;
    cin>>m;
    cout<<"move  “<<m<<“  diskes:\n";
    hanoi(m,'A','B','C');
}