python--斐波那契数列 汉诺塔

斐波那契数列

F(n) = F(n-1) + F(n-2)

def f(n):
	if n== 1 or n == 2 :
		return 1
	else :
		return f(n-1) + f(n-2)

汉诺塔

count = 0
def hanoi(n,src, dst, mid) :
	global count
	if n == 1 :
		print("{}:{}->{}".format(1,src,dst))
		count += 1
	else:
		hanoi(n - 1,src,mid,dst)
		print("{}:{}->{}".format(n,src,dst))
		count += 1
		hanoi(n - 1, mid, dst, src)
hanoi(3,"A", "C", "B")
print(count)