python 实现 斐波那契数列
递归法
def fibo(i): if i==0 or i==1: return 1 else: return fibo(i-1)+fibo(i-2)
def fibo2(n): stack=[] if n==0 or n==1: return 1 else: stack.append(1) stack.append(1) for i in range(2,n): stack.append(stack[i-1]+stack[i-2]) return stackprint fibo2(2)
