面试现场编写代码-实现斐波那契数列的第N项
class Solution: def Fibonacco(self,n): a,b=0,1 for i in range(n): a,b=b,(a+b) return a n=int(input()) obj=Solution() a=obj.Fibonacco(n) print(a) #1,1,2,3,5,8,13,21
class Solution: def Fibonacco(self,n): a,b=0,1 for i in range(n): a,b=b,(a+b) return a n=int(input()) obj=Solution() a=obj.Fibonacco(n) print(a) #1,1,2,3,5,8,13,21
相关推荐