题解 | 斐波那契数列
斐波那契数列
https://www.nowcoder.com/practice/ee5d403c1172487f8c7915b3c3d924c6
#include <stdio.h>
int main() {
int n;
scanf("%d",&n);
int dp[n];
dp[0]=1;
dp[1]=1;
for(int i=2;i<n;i++){
dp[i]=dp[i-1]+dp[i-2];
}
printf("%d",dp[n-1]);
}
查看10道真题和解析