Python day4:函数2

3.递归函数

汉诺塔:

def move(n,a,b,c):
{
   if(n==1):
      print('move %c to %c'%(a,c))
   else:
      move(n-1,a,c,b)
      move(1,a,b,c)
      move(n-1,b,a,c)
}
move(3,'A','B','C')

move A to C
move A to B
move C to B
move A to C
move B to A
move B to C
move A to C