斐波那契，非递归形式(python)

随手写了写斐波那契函数，粘贴上来。
顺便膜拜一下python对大数加法的支持。

#Fibonacci, F(0)=0, F(1)=1
def Fib(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        fib = [0 for i in range(n+1)]
        fib[0] = 0
        fib[1] = 1
        for i in range(2,n+1,1):
            fib[i] = fib[i-1]+fib[i-2]

        return fib[n]