题目要求
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).
题目分析及思路
题目给出斐波那契数列，要求返回第n个数字。可使用列表存放数列。
python代码
class Solution:
def fib(self, N):
"""
:type N: int
:rtype: int
"""
扫描二维码关注公众号，回复：
5127526 查看本文章
res = [0,1]
for i in range(2,N+1):
res.append(res[i-1]+res[i-2])
return res[N]