509 Fibonacci Number

1. Description

The Fibonacci numbers, commonly denoted F(n) form as sequence, called the Fibonacci sequence, such that each number is the sum of two preceding oens, starting 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).

 

constraints :

• 0 <= n <= 30

2. Algorithms

1. Start
2. Declare variable named dp and initialize to [0, 1].
3. Repeat through integers range 2 to n.
   1. Append the result of sum of two previous values.
4. Return the final value.
5. End

 

3. Codes

class Solution:
    def fib(self, n: int) -> int:
        dp = [0, 1]
        for i in range(2, n+1) : 
            dp.append(dp[i-1] + dp[i-2])
        return dp[n]

 

4. Conclusion