python:递归函数（汉诺塔） 

 1 #hanoi.py
 2 def hanoi(n,x,y,z):
 3     if n==1:
 4         print(x,"-->",z)
 5     else:
 6         hanoi(n-1,x,z,y)
 7         print(x,"-->",z)
 8         hanoi(n-1,y,x,z)
 9 hanoi(2,"X","Y","Z")
10 print("----------")
11 hanoi(3,"X","Y","Z")

结果如下：

posted @ 2019-02-22 00:09  奔跑的蜗牛腿儿  阅读(628)  评论(0)    收藏  举报