您的位置:首页 > 编程语言 > Python开发

1.python算法之汉诺塔

2016-03-20 20:30 603 查看
代码如下:

#!/usr/bin/env python
# encoding: utf-8
"""
@author: 侠之大者kamil
@file: 汉诺塔.py
@time: 2016/3/20 20:00
"""
m = input(">>Please enter a maximum value of the sequence:")
m = int(m)+1
def move(a,b,c,n):
if n ==1:
print("%s ->> %s : %s" %(a[0],b[0],a[-1]))
b.append(a.pop())
print(x,y,z)
return
move(a,c,b,n-1)
print("%s ->> %s : %s" %(a[0],b[0],a[-1]))
b.append(a.pop())
print(x,y,z)
move(c,b,a,n-1)
x = ['x']
y = ['y']
z = ['z']
for n in range(1,m)[::-1]:
x.append(n)
move(x,y,z,m-1)
print(x,y,z)
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: