汉诺塔问题C++的递归实现 [

 

1. #include <iostream.h>
   
2. void moveDisks(int disknum,char sourcePole,char targetPole,char midPole);
   
3. int main()
   
4. {
   
5. int n;
   
6. cout<<"请输入盘子的数目：";
   
7. cin>>n;
   
8. if(n<=0)
   
9. cout<<"盘子数目必须大于0";
   
10. else
    
11. moveDisks(n,'A','C','B');
    
12. return 0;
    
13. }
    
14. void moveDisks(int disknum,char sourcePole,char targetPole,char midPole)
    
15. {
    
16. if (disknum==1)
    
17. cout<<sourcePole<<"->"<<targetPole<<endl;
    
18. else
    
19. {
    
20. moveDisks(disknum-1,sourcePole,midPole,targetPole);
    
21. cout<<sourcePole<<"->"<<targetPole<<endl;
    
22. moveDisks(disknum-1,midPole,targetPole,sourcePole);
    
23. }
    
24. }

复制代码