题解 | #斐波那契数列#
斐波那契数列
https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
class Solution: def Fibonacci(self , n: int) -> int: # write code here if n <= 2: return 1 x = 1 y = 1 sum = 1 for i in range(3, n+1): x = y y = sum sum = x + y return sum
，慢慢来，24届老学长离职两个月，被拷打了30多次了