Skip to content

Latest commit

 

History

History
70 lines (46 loc) · 1.69 KB

509-fibonacci-number.md

File metadata and controls

70 lines (46 loc) · 1.69 KB

509. Fibonacci Number - 斐波那契数

斐波那契数,通常用 F(n) 表示,形成的序列称为斐波那契数列。该数列由 01 开始,后面的每一项数字都是前面两项数字的和。也就是:

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

题目标签:Array

题目链接:LeetCode / LeetCode中国

题解

Language Runtime Memory
python3 36 ms 13 MB
class Solution:
    def fib(self, N: int) -> int:
        arr = [0, 1]
        if N < 2:
            return arr[N]
        else:
            for i in range(2, N + 1):
                arr.append(arr[-1] + arr[-2])
            return arr[N]