hannuo tower

hanuota.cpp

---

#include<iostream>using namespace std;void hanuota(int n,char source,char destination,char depend){    if(n==1)        cout<<n<<"   "<<source<<"-------->>"<<destination<<endl;    else{        hanuota(n-1,source,depend,destination);        cout<<n<<"   "<<source<<"-------->>"<<destination<<endl;        hanuota(n-1,depend,destination,source);    }} 

经典的递归思想。