汉诺塔递归
汉诺塔递归的解释:
https://www.zhihu.com/question/24385418
代码:
def move(n, a, b, c): # n个塔块要从a移动到c,借助b
if n <= 0 :
return "the number must be larger than zero !"
elif n == 1 :
print a, '-->', c
return wly
else :
move(n-1, a, c, b) # 把前n-1个塔块从a移动到b,借助c;
print a, '-->', c # 把最大块移到从a移到c;
move(n-1, b, a, c) # 把剩余n-1从b移到c,借助a;
move(4, 'A', 'B', 'C')