斐波那契数列

来源:互联网 发布:开淘宝网店的流程视频 编辑:程序博客网 时间:2024/06/03 17:30

大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项。
n<=39

网址:https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=13&tqId=11160&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

代码:

# -*- coding:utf-8 -*-class Solution:    def Fibonacci(self, n):        if n == 0:            return 0        if n == 1:            return 1        fn0 = 0        fn1 = 1        for i in range(2,n+1):            curent = fn0 + fn1            fn0 = fn1            fn1 = curent        return curent        # write code here
原创粉丝点击