c#的汉诺塔算法怎么写

这篇"c#的汉诺塔算法怎么写"文章的知识点大部分人都不太理解，所以小编给大家总结了以下内容，内容详细，步骤清晰，具有一定的借鉴价值，希望大家阅读完这篇文章能有所收获，下面我们一起来看看这篇"c#的汉诺塔算法怎么写"文章吧。

#include void main(){  extern a;  extern b;  extern c;  extern s;  void hanno(int,char,char,char);  void setNum(int);  int n;  printf("Please input the number of dishes: ");  scanf("%d",&n);  printf("The following is moving %d dishes ...\n             (%2d  0  0)\n",n,n);  setNum(n);  hanno(n,'A','B','C');}int a;int b;int c;int s;void setNum(int m){  a=m;}void hanno(int m,char pillar1,char pillar2,char pillar3){  void move(char,char,int);  if(m==1) {    s++;    move(pillar1,pillar3,s);  } else {    hanno(m-1,pillar1,pillar3,pillar2);    s++;    move(pillar1,pillar3,s);    hanno(m-1,pillar2,pillar1,pillar3);  };}void move(char x,char y,int s){  if (x=='A' && a>0 ) a--;  else if (x=='B' && b>0 ) b--;  else if (x=='C' && c>0 ) c--;    if (y=='A') a++;  else if (y=='B') b++;  else if (y=='C') c++;  printf("%3d: %c --> %c (%2d %2d %2d)\n",s,x,y,a,b,c);}

#gcc hannuota.c -o hannuota

# ./hannuota
Please input the number of dishes: 3
The following is moving 3 dishes ...
( 3 0 0)

1: A --> C ( 2 0 1)
2: A --> B ( 1 1 1)
3: C --> B ( 1 2 0)
4: A --> C ( 0 2 1)
5: B --> A ( 1 1 1)
6: B --> C ( 1 0 2)
7: A --> C ( 0 0 3)

以上就是关于"c#的汉诺塔算法怎么写"这篇文章的内容，相信大家都有了一定的了解，希望小编分享的内容对大家有帮助，若想了解更多相关的知识内容，请关注行业资讯频道。