The Fibonacci numbers, commonly denoted F(n)
form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0
and 1
. That is,
F(0) = 0, F(1) = 1
F(N) = F(N - 1) + F(N - 2), for N > 1.
Given N
, calculate F(N)
.
Example 1:
Input: 2
Output: 1
Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.
Example 2:
Input: 3
Output: 2
Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.
Example 3:
Input: 4
Output: 3
Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.
解题思路
递归解题,不用多说了吧~ ,或者改进递归计算过程减去不必要的计算,使用动态规划。
解题代码
class Solution {
public int fib(int N) {
if (N <= 1) return N;
return fib(N - 1) + fib(N - 2);
}
}
dp:以后专门出动态规划,到时候可以详细地做一个笔记整理一下~
class Solution {
public int fib(int N) {
if (N <= 1) return N;
int [] dp = new int [N + 1];
dp[0] = 0;
dp[1] = 1;
for (int i = 2; i < N + 1; i++)
dp[i] = dp[i - 1] + dp[i - 2];
return dp[N];
}
}