斐波那契数
描述
简单
斐波那契数,通常用 F(n)
表示,形成的序列称为 斐波那契数列 。该数列由 0 和 1 开始,后面的每一项数字都是前面两项数字的和。也就是:
F(0) = 0,F(1) = 1
F(n) = F(n - 1) + F(n - 2),其中 n > 1
给你 n ,请计算 F(n) 。
示例 1:
输入:2
输出:1
解释:F(2) = F(1) + F(0) = 1 + 0 = 1
示例 2:
输入:3
输出:2
解释:F(3) = F(2) + F(1) = 1 + 1 = 2
示例 3:
输入:4
输出:3
解释:F(4) = F(3) + F(2) = 2 + 1 = 3
提示:
0 <= n <= 30
解题
经典
递归
# python
class Solution:
def fib(self, n: int) -> int:
if n == 0 or n == 1:
return n
return self.fib(n - 1) + self.fib(n - 2)
// java
class Solution {
public int fib(int n) {
if (n == 0 || n == 1) return n;
return fib(n - 1) + fib(n - 2);
}
}
数组/动态规划
# python
class Solution:
def fib(self, n: int) -> int:
if n == 0 or n == 1:
return n
arr = [0 for _ in range(n + 1)]
arr[1] = 1
for i in range(2, n + 1):
arr[i] = arr[i - 1] + arr[i - 2]
return arr[n]
// java
class Solution {
public int fib(int n) {
if (n == 0 || n == 1) return n;
int[] arr = new int[n + 1];
arr[0] = 0;
arr[1] = 1;
for (int i = 2; i < n + 1; i++) {
arr[i] = arr[i - 1] + arr[i - 2];
}
return arr[n];
}
}
数值替换
# python
class Solution:
def fib(self, n: int) -> int:
if n == 0 or n == 1:
return n
x = 0
y = 1
for i in range(n - 1):
z = x + y
x = y
y = z
return z
// java
class Solution {
public int fib(int n) {
if (n == 0 || n == 1) return n;
int x = 0;
int y = 1;
int z = 1;
for (int i = 0; i < n - 1; i++) {
z = x + y;
x = y;
y = z;
}
return z;
}
}