LeetCode/Easy/509.FibonacciNumber(Dict).py at master · YuriSpiridonov/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
"""
    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:
    Input: 4
    Output: 3
    Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.

    Note:
    0 ≤ N ≤ 30.
"""
#Difficulty: Easy
#31 / 31 test cases passed.
#Runtime: 24 ms
#Memory Usage: 13.7 MB

#Runtime: 24 ms, faster than 93.52% of Python3 online submissions for Fibonacci Number.
#Memory Usage: 13.7 MB, less than 5.80% of Python3 online submissions for Fibonacci Number.

class Solution:
    def fib(self, N: int) -> int:
        fib = {0:0, 1:1, 2:1}
        if N <= 2:
            return fib[N]
        for i in range(3, N+1):
            fib[i] = fib[i-1] + fib[i-2]
        return fib[N]