题解 | #斐波那契数列#
斐波那契数列
https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
class Solution:
def Fibonacci(self , n: int) -> int:
tmp1 = 1
tmp2 = 1
for i in range(2, n):
tmp = tmp1 + tmp2
tmp1 = tmp2
tmp2 = tmp
return tmp2
时间复杂度为O(N),空间复杂度为O(1)。
查看8道真题和解析