if n == 1: print(a, '-->', c) else: move(n-1,a,c,b)#a柱最上方的n-1个盘子落在b柱 move(1,a,b,c)#a柱的最小面盘子落在c柱 move(n-1,b,a,c)#b柱上的n-1个盘子,落在c柱
Sign in to make a reply
钱老板boss