题目描述:
题解:
class Solution(object): def fib(self, n): fibres = [] fibres.append(0) fibres.append(1) if n<=1: return fibres[n] for i in range(2,n+1): fibres.append(fibres[i-1]+fibres[i-2]) return fibres[n]
java版:
class Solution { public int fib(int n) { int [] fibres = new int[n+1]; if(n==0){ return 0; } if(n==1){ return 1; } fibres[0]=0; fibres[1]=1; for(int i=2;i<=n;i++){ fibres[i] = fibres[i-1]+fibres[i-2]; } return fibres[n]; } }