这道题的关键是递归的思想,到达第m个台阶,只有两种方案,m-1,m-2,即为a[m]=a[m-1]+a[m-2]。
while (t--)
{
int n;
scanf("%d", &n);
a[1] = 0;
a[2] = 1;
a[3] = 2;
for (int i = 4; i <= n; i++)
{
a[i] = a[i - 1] + a[i - 2];
}
printf("%d\n", a[n]);
}
这道题的关键是递归的思想,到达第m个台阶,只有两种方案,m-1,m-2,即为a[m]=a[m-1]+a[m-2]。
while (t--)
{
int n;
scanf("%d", &n);
a[1] = 0;
a[2] = 1;
a[3] = 2;
for (int i = 4; i <= n; i++)
{
a[i] = a[i - 1] + a[i - 2];
}
printf("%d\n", a[n]);
}