fibonacci in dynamic programing way

fibonacci.py

#fibonacci series with dynamic programing Approach  !
#better way ...

def fib(n):
    l = [1,1]
    if n == 0 :
        return 1
    elif n == 1 :
        return 1
    elif n == 2 :
        return l
    elif n>2 :
        temp = 0
        for i in range(n-2):
            temp = l[-2] + l[-1]
            l.append(temp)
        return l



print(fib(1))
print(fib(2))
print(fib(3))
print(fib(12))