汉诺塔的C++.doc

汉诺塔的C/C+程序2009-11-05 09:58:08| 分类： 默认分类 | 标签：无|字号大中小订阅借鉴+创新=succes 我已调试成功，新手望指教/ hanoizjqendend.cpp : Defines the entry point for the console application./zjq/ 9:18/11/4/2009/profit:先搭架构再填函数/ 递归的思想：一个出口+一个关系/ 函数入口是形参，出口是return(只有一个返回值)或指针|引用（直接改变内存值）/ 注意全局变量的应用好处/ 灵活的思维+好的习惯/ return 0;和break;都有中断异情的作用，灵活用之#include #include #include struct layer int numOfTower; int Layer12;struct Hanoi struct layer a; struct layer b; struct layer c; ;struct Hanoi H=1,1,2,3,4,5,6,7,8,9,10,11,12,2,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0;/初始化/,/;/void hanoi(int n,struct layer*pre,struct layer*mid,struct layer*end);void displayOfNum(int n,struct layer*pre,struct layer*mid,struct layer*end);/步骤d数字显示void move2end(int n_bottom,struct layer*pre,struct layer*mid,struct layer*end);int createHanoi();void displayOfImage(int m,struct layer*pre,struct layer*mid,struct layer*end);/步骤d图像显示void Delay(int seconds) ;/delay functionvoid moveLayer(int m,struct layer*pre,struct layer*mid,struct layer*end);/塔层移动：改变layer值void starplay(int m);/每次输出m个“*”int sumOfStep=0;/record the stepsint n=0;struct layer*pre=&H.a; /initializationstruct layer*mid=&H.b; /将柱子的编号地址交给指针struct layer*end=&H.c;main() n=createHanoi(); /创建的塔层数 hanoi(n,pre,mid,end); cout总共步数：sumOfStependl; /setw(n) 右对齐 return 0;/汉诺塔递归函数void hanoi(int n,struct layer*pre,struct layer*mid,struct layer*end)/修改一定是依据形参进行的,里面形参决定一切 /递归的同一个函数关系： /hanoi(int n,int*pre,int*mid,int*end) /只要将其他的要求解的函数对应的参数传 /递过来就好了 if(n=1) /递归出口:初始值/初始步骤 /递归一定要有出口 /this is important/ displayOfNum(1,pre,mid,end); /函数运行到出口就回到下一步了 moveLayer(0,pre,mid,end); /记录塔层移动后的塔层分布，i.e layer的重新赋值 displayOfImage(0,pre,mid,end); else /递归精髓1个出口 + 1个f(n)与f(n-1)的关系 hanoi(n-1,pre,end,mid); /f(n)与f(n-1)的循环关系 move2end(n,pre,mid,end); /实为move2end(n,pre,end)，中间mid是为了显示用的; hanoi(n-1,mid,pre,end); /步骤的数字显示void displayOfNum(int n,struct layer*pre,struct layer*mid,struct layer*end) cout(*pre).numOfTower(*end).numOfTowerendl; sumOfStep+;/A底到C底-move2endvoid move2end(int n_bottom,struct layer*pre,struct layer*mid,struct layer*end) cout(*pre).numOfTower(*end).numOfTowerendl; sumOfStep+; moveLayer(0,pre,mid,end); displayOfImage(0,pre,mid,end);/创建汉诺塔int createHanoi() int m; /m: the layers of beginningstart: coutinput the number of the hanoi tower(12):m; if(m12) coutthe number is outflow,please input again:endl; goto start; /return 0; return m;/图像显示void displayOfImage(int m,struct layer*pre,struct layer*mid,struct layer*end) /显示有问题，未掉过顺序来 for(m=0;mn;m+) if(*pre).numOfTower=1) starplay(*pre).Layerm); /(*pre).numOfTower来决定显示的顺序 else if(*mid).numOfTower=1) starplay(*mid).Layerm); else starplay(*end).Layerm);if(*pre).numOfTower=2) starplay(*pre).Layerm); /(*pre).numOfTower来决定显示的顺序 else if(*mid).numOfTower=2) starplay(*mid).Layerm); else starplay(*end).Layerm);if(*pre).numOfTower=3) starplay(*pre).Layerm); /(*pre).numOfTower来决定显示的顺序 else if(*mid).numOfTower=3) starplay(*mid).Layerm); else starplay(*end).Layerm); coutendl; /cout(*pre).Layer0(*mid).Layer2endl; Delay(1); /动态渐近显示 /coutsetw(3)* endlsetw(3)*endl;/塔层移动-分情况讨论，为零的情况有多种，1a=0,c=1 |2a=0,c=0 |3a=1,c=1 |4a=1,c=1void moveLayer(int m,struct layer*pre,struct layer*mid,struct layer*end) int i,j; for(i=m;in;i+) if(*pre).Layern-1=0) i=n-1; break; else if(*pre).Layeri!=0) break; for(j=m;jn;j+) if(*end).Layern-1=0) j=n-1; break; else if(*end).Layerj=0&(*end).Layerj+1!=0) break; (*end).Layerj=(*pre).Layeri; (*pre).Layeri=0;/延时程序void Delay(int seconds)/延时seconds秒的程序 入口 delay(int n)，强制延时 clock_t start=clock();/像计数器 clock_t lay=(clock_t)seconds*CLOCKS_PER_SEC; while(clock()-start)lay);/星星显示void starplay(int j) int maxLayer=2*n-1; int numOfOut=(2*j-1); int blankNum1=(maxLayer-numOfOut)/2;/空格数 int blankNu