汉诺塔问题（递归）
# _*_coding:utf-8_*_
def hanoi(n, a, b, c):
if n > 0:
hanoi(n - 1, a, c, b)
print("moving from %s to %s" % (a, c))
hanoi(n - 1, b, a, c)
hanoi(5, 'A', 'B', 'C')
# _*_coding:utf-8_*_
def hanoi(n, a, b, c):
if n > 0:
hanoi(n - 1, a, c, b)
print("moving from %s to %s" % (a, c))
hanoi(n - 1, b, a, c)
hanoi(5, 'A', 'B', 'C')