汉诺塔问题的递归程序

//汉诺塔问题的递归程序/**void TowersOfHanoi(int n,int x,int y,int z){ //把n个碟子从塔x移动到塔y，可借助于塔z if(n>0) { TowersOfHanoi(n-1,x,z,y); cout<<"Move top disk from tower"<<x<<"to top of to

>>阅读原文<<