递归问题：斐波那契，汉诺塔

斐波那契函数

__author__ = 'hp'

import sys
sys.setrecursionlimit(10000)

def fibo(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fibo(n-1)+fibo(n-2)


# 递归优化
def fibo_good(n):
    a = 0
    b = 1
    while n>1:
        c = a+b
        a = b
        b = c
        n -= 1
    return c

print(fibo_good(1000))

汉诺塔问题

__author__ = 'hp'

# 递归：汉诺塔问题 a,b,c三根柱子，64个从小到大的盘子在a柱上，需要移动到c柱上
# a:start b:through b:end

def hanoi(n,a,b,c):
    if n> 0:
        hanoi(n-1,a,c,b)
        print('%s -> %s' %(a,c))
        hanoi(n-1,b,a,c)

hanoi(2,'A','B','C')