06python 中的递归函数（python函数）

n = 0


def story():
    global n
    n += 1
    print(n)
    story()


story()
>>>1
...
998

def fib(n):
    """
    This is Fibonacci by Recursion.
    """
    if n==0:
        return 0
    elif n==1:
        return 1
    else:
        return fib(n-1) + fib(n-2)

meno = {0:0, 1:1}    #初始化

def fib(n):
    if not n in meno:    #如果不在初始化范围内
        meno[n] = fib(n-1) + fib(n-2)
    return meno[n]


f = fib(10)
print f

>>>55

def fact(n):
    if n==1:
        return 1
    return n * fact(n - 1)