版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/weixin_41679411/article/details/86482913
题目描述:
大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项(从0开始,第0项为0)。
n<=39
思路:
标准的DP,讨巧也可以写通项。
代码:
# -*- coding:utf-8 -*-
class Solution:
def Fibonacci(self, n):
# write code here
if n == 0:
return 0
elif n == 1 or n == 2:
return 1
else:
for i in range(n+1):
if i == 0:
fib_1 = 0
elif i == 1:
fib_2 = 1
else:
tmp = fib_2
fib_2 = fib_1 + fib_2
fib_1 = tmp
return fib_2