问题: a0 =0,a1 =1...ak = ak-1 +ak-2 ,求an 解答: 1. 递归 def fib(n): if n == 0: return 0 elif n == 1: return 1 else: return fib(n-1) + fib(n-2) 2. 迭代 a, b = 0, 1 while b < n: print b, a, b = b, a+b 3.矩阵 from numpy import matrix k=0 b=1 a = matrix([[1,1],[1,0]]) while k < N: if k%2==0: k=k/2 a=a*a else: k=k-1 b=b*c