Dashboard Temp Share Shortlinks Frames API

HTMLify

LeetCode - Fibonacci Number - Python
Views: 524 | Author: abh
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
class Solution:
    def fib(self, n: int) -> int:
        if n == 0:
            return 0
        if n == 1:
            return 1
        fibo = [0, 1]
        for _ in range(n-1):
            fibo.append(fibo[-1]+fibo[-2])
        return fibo[-1]