[leetcode] 509. Fibonacci Number

Description

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 1:

Input: 2
Output: 1
Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.

Example 2:

Input: 3
Output: 2
Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.

Example 3:

Input: 4
Output: 3
Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.

Note:

1. 0 ≤ N ≤ 30.

分析

题目的意思是：这是一个fibonacci数列的问题，可以用递归实现，也可以用迭代的方式，我选择了迭代的方式，注意要考虑到N=0和1的情况，其他情况就一个一个的按照递推公式进行遍历了，这个应该是比较简洁的实现方式了哈，所以我就不看参考答案了哈。

代码

class Solution:
    def fib(self, N: int) -> int:
        a=1
        b=0
        if(N==0):
            return b
        elif(N==1):
            return a
        
        for i in range(N-1):
            a,b=a+b,a
        return a