509. 斐波那契数
斐波那契数 (通常用 F(n)
表示)形成的序列称为 斐波那契数列 。该数列由 0 和 1 开始,后面的每一项数字都是前面两项数字的和。也就是:
F(0) = 0,F(1) = 1
F(n) = F(n - 1) + F(n - 2),其中 n > 1
给定 n
,请计算 F(n)
。
示例 1:
输入:n = 2
输出:1
解释:F(2) = F(1) + F(0) = 1 + 0 = 1
示例 2:
输入:n = 3
输出:2
解释:F(3) = F(2) + F(1) = 1 + 1 = 2
示例 3:
输入:n = 4
输出:3
解释:F(4) = F(3) + F(2) = 2 + 1 = 3
提示:
0 <= n <= 30
记录题解
import java.util.ArrayList;
import java.util.List;
public class FibonacciNumber{
public static void main(String[] args) {
Solution solution = new FibonacciNumber().new Solution();
}
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
public int fib(int n) {
if (n == 0) return 0;
List<Integer> list = new ArrayList<>();
list.add(1);
list.add(1);
int i = 3;
while(i <= n){
int temp = list.get(i - 2) + list.get(i - 3);
list.add(i-1,temp);
i++;
}
return list.get(n-1);
}
}
//leetcode submit region end(Prohibit modification and deletion)
}
力扣官方题解(动态规划)
class Solution {
public int fib(int n) {
if (n < 2) {
return n;
}
int p = 0, q = 0, r = 1;
for (int i = 2; i <= n; ++i) {
p = q;
q = r;
r = p + q;
}
return r;
}
}
类似题目
剑指Offer 10- l.斐波那契数列
1137.第N个泰波那契数