Leetcode 509. Fibonacci Number

最新推荐文章于 2024-07-05 21:55:11 发布

小白菜又菜

最新推荐文章于 2024-07-05 21:55:11 发布

阅读量171

点赞数

分类专栏： Leetcode 解题报告入门题文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/mobius_strip/article/details/131803407

版权

解题报告同时被 3 个专栏收录

1360 篇文章 4 订阅

订阅专栏

入门题

285 篇文章 2 订阅

订阅专栏

Leetcode

138 篇文章 0 订阅

订阅专栏

Problem

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).

Algorithm

Calculated using the recursive formula.

Code

class Solution:
    def fib(self, n: int) -> int:
        if n < 2:
            return n

        Fn_2, Fn_1, = 0, 1
        for i in range(2, n+1):
            Fn = Fn_1 + Fn_2
            Fn_2 = Fn_1
            Fn_1 = Fn
        
        return Fn