Python

Python 汉诺塔问题

def move(n, a='A', b='B', c='C'): if n == 1: return print(a, "->", c) else: move((n-1), a, c, b) print(a, "->", c) move((n-1), b, a, c) …