题解 | #斐波那契数列#
斐波那契数列
https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
class Solution:
def Fibonacci(self , n: int) -> int:
dp = [0]*n
dp[0], dp[1] = 1, 1
for i in range(2, n):
dp[i] = dp[i - 1] + dp[i - 2]
return dp[n - 1]
投递宇宙厂等公司8个岗位