题解 | #斐波那契数列#
斐波那契数列
https://www.nowcoder.com/practice/ee5d403c1172487f8c7915b3c3d924c6
n=int(input())
dp=[1]*(n+1)
dp[0]=0
if n<2:
print(dp[n])
else:
for i in range(2,n+1):
dp[i]=dp[i-1]+dp[i-2]
print(dp[n])
dp=[1]*(n+1)
dp[0]=0
if n<2:
print(dp[n])
else:
for i in range(2,n+1):
dp[i]=dp[i-1]+dp[i-2]
print(dp[n])
投递牛客等公司