题目
写一个函数,输入 n ,求斐波那契(Fibonacci)数列的第 n 项(即 F(N))。斐波那契数列的定义如下:
F(0) = 0, F(1) = 1
F(N) = F(N - 1) + F(N - 2), 其中 N > 1.
斐波那契数列由 0 和 1 开始,之后的斐波那契数就是由之前的两数相加而得出。
答案需要取模 1e9+7(1000000007),如计算初始结果为:1000000008,请返回 1。
示例 1:
输入:n = 2
输出:1
示例 2:
输入:n = 5
输出:5
提示:
0 <= n <= 100
思路:利用数组存储对应n的值,
题解
class Solution {
public int fib(int n) {
if (n <2) {
return n;
}
int[] data = new int[n + 1];
data[0] = 0;
data[1] = 1;
for (int i = 2 ;i <= n;i ++) {
data[i] = (data[i-1] + data[i-2])%1000000007;
}
return data[n]%1000000007;
}
}
也可以考虑用两个变量
class Solution {
public int fib(int n) {
if (n <2) {
return n;
}
int pre = 0;
int next = 1;
int res = 0;
for (int i = 2 ;i <= n;i ++) {
res = (pre + next)%1000000007;
pre = next;
next = res;
}
return res%1000000007;
}
}
青蛙跳台阶
public int numWays(int n) {
if (n == 0 || n==1) {
return 1;
}
int pre = 1;
int next = 1;
int res = 0;
for (int i = 2 ;i <= n;i ++) {
res = (pre + next)%1000000007;
pre = next;
next = res;
}
return res%1000000007;
}