题目
写一个函数，输入 n ，求斐波那契（Fibonacci）数列的第 n 项。斐波那契数列的定义如下：F(0) = 0, F(1) = 1 F(N) = F(N - 1) + F(N - 2), 其中 N > 1.
代码
public int fib(int n
) {
if(n
==0||n
==1){
return n
;
}
int []fibo
= new int[n
+1];
fibo
[0] = 0;
fibo
[1] = 1;
for(int i
= 2;i
<=n
;i
++){
fibo
[i
] = fibo
[i
-1]+fibo
[i
-2];
fibo
[i
] = fibo
[i
]%1000000007;
}
return fibo
[n
];
}
