斐波那契数列
题目:写一个函数,输入 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。
输入:n = 2
输出:1
方法一:递归(超时)
class Solution {
public int fib(int n) {
if(n < 2) return n;
return (fib(n - 1) + fib(n - 2)) % 1000000007;
}
}
方法二:动态规划
class Solution {
public int fib(int n) {
if(n < 2) return n;
int[] dp = new int[n+1];
dp[1] = 1;
for (int i = 2; i <= n; i++) {
dp[i] = (dp[i-1] + dp[i-2])%1000000007;
}
return dp[n];
}
}
优化
class Solution {
public int fib(int n) {
if(n < 2) return n;
int ans = 0;
int p = 0, q = 1;
for (int i = 2; i <= n; i++) {
ans = (p + q)%1000000007;
p = q;
q = ans;
}
return ans;
}
}
class Solution {
public int numWays(int n) {
if (n == 0||n == 1) return 1;
int all = 0;
int a = 1, b = 1;
for (int i = 2; i <= n; i++) {
all = (a + b)%1000000007;
a = b;
b = all;
}
return all;
}
}