斐波那契数列----python(无递归)
class Solution: """ @param: n: an integer @return: an ineger f(n) """ def fibonacci(self, n): a=[0,1] if n<2: return a[n-1] for i in range(2,n): a.append(a[-1]+a[-2]) return a[-1]
首项为0
a.append(a[-1]+a[-2])这一行不能使用n
class Solution: """ @param: n: an integer @return: an ineger f(n) """ def fibonacci(self, n): a=[0,1] if n<2: return a[n-1] for i in range(2,n): a.append(a[-1]+a[-2]) return a[-1]
首项为0
a.append(a[-1]+a[-2])这一行不能使用n