meaning2的博客

程序如下：/* 递归 汉诺塔问题*/void move(char x, char y){ printf("%c->%c\n", x, y);}void hanoi(int n, char one, char two, char three){ if (n == 1) move(one, three); else { hanoi(n - 1, one, three, two);//将one上n-1个盘